math.exp on complex, real part

Percentage Accurate: 100.0% → 100.0%

Time: 15.0s

Alternatives: 20

Speedup: 1.0×

• 24.5% 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} \\ 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]

Derivation

1. Initial program 100.0%

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

Alternative 2: 99.2% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (exp re) (cos im)))
        (t_1 (fma re (fma re 0.16666666666666666 0.5) 1.0)))
   (if (<= t_0 (- INFINITY))
     (* (exp re) (fma im (* im -0.5) 1.0))
     (if (<= t_0 -0.05)
       (*
        (cos im)
        (*
         (fma
          re
          (* t_1 (fma (fma re 0.16666666666666666 0.5) (* re re) re))
          -1.0)
         (/ 1.0 (fma re t_1 -1.0))))
       (if (<= t_0 1e-13)
         (exp re)
         (if (<= t_0 0.9999999999999997)
           (* (cos im) (fma re t_1 1.0))
           (exp re)))))))

C

double code(double re, double im) {
	double t_0 = exp(re) * cos(im);
	double t_1 = fma(re, fma(re, 0.16666666666666666, 0.5), 1.0);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = exp(re) * fma(im, (im * -0.5), 1.0);
	} else if (t_0 <= -0.05) {
		tmp = cos(im) * (fma(re, (t_1 * fma(fma(re, 0.16666666666666666, 0.5), (re * re), re)), -1.0) * (1.0 / fma(re, t_1, -1.0)));
	} else if (t_0 <= 1e-13) {
		tmp = exp(re);
	} else if (t_0 <= 0.9999999999999997) {
		tmp = cos(im) * fma(re, t_1, 1.0);
	} else {
		tmp = exp(re);
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(exp(re) * cos(im))
	t_1 = fma(re, fma(re, 0.16666666666666666, 0.5), 1.0)
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(exp(re) * fma(im, Float64(im * -0.5), 1.0));
	elseif (t_0 <= -0.05)
		tmp = Float64(cos(im) * Float64(fma(re, Float64(t_1 * fma(fma(re, 0.16666666666666666, 0.5), Float64(re * re), re)), -1.0) * Float64(1.0 / fma(re, t_1, -1.0))));
	elseif (t_0 <= 1e-13)
		tmp = exp(re);
	elseif (t_0 <= 0.9999999999999997)
		tmp = Float64(cos(im) * fma(re, t_1, 1.0));
	else
		tmp = exp(re);
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Exp[re], $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(re * N[(re * 0.16666666666666666 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[Exp[re], $MachinePrecision] * N[(im * N[(im * -0.5), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, -0.05], N[(N[Cos[im], $MachinePrecision] * N[(N[(re * N[(t$95$1 * N[(N[(re * 0.16666666666666666 + 0.5), $MachinePrecision] * N[(re * re), $MachinePrecision] + re), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision] * N[(1.0 / N[(re * t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 1e-13], N[Exp[re], $MachinePrecision], If[LessEqual[t$95$0, 0.9999999999999997], N[(N[Cos[im], $MachinePrecision] * N[(re * t$95$1 + 1.0), $MachinePrecision]), $MachinePrecision], N[Exp[re], $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. unpow2 N/A

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

      3. associate-*r* N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 100.0

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

   5. Applied rewrites 100.0%

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

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

   1. Initial program 99.8%

      \[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. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 96.7

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

   5. Applied rewrites 96.7%

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

   7. Applied rewrites 96.7%

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

   if -0.050000000000000003 < (*.f64 (exp.f64 re) (cos.f64 im)) < 1e-13 or 0.999999999999999667 < (*.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}} \]

   if 1e-13 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.999999999999999667

   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. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 99.8

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

   5. Applied rewrites 99.8%

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

4. Final simplification 99.7%

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

Alternative 3: 99.2% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0
         (*
          (cos im)
          (fma re (fma re (fma re 0.16666666666666666 0.5) 1.0) 1.0)))
        (t_1 (* (exp re) (cos im))))
   (if (<= t_1 (- INFINITY))
     (* (exp re) (fma im (* im -0.5) 1.0))
     (if (<= t_1 -0.05)
       t_0
       (if (<= t_1 1e-13)
         (exp re)
         (if (<= t_1 0.9999999999999997) t_0 (exp re)))))))

C

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

Julia

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

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Cos[im], $MachinePrecision] * N[(re * N[(re * N[(re * 0.16666666666666666 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Exp[re], $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[Exp[re], $MachinePrecision] * N[(im * N[(im * -0.5), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -0.05], t$95$0, If[LessEqual[t$95$1, 1e-13], N[Exp[re], $MachinePrecision], If[LessEqual[t$95$1, 0.9999999999999997], t$95$0, 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. unpow2 N/A

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

      3. associate-*r* N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 100.0

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

   5. Applied rewrites 100.0%

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

   if -inf.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < -0.050000000000000003 or 1e-13 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.999999999999999667

   1. Initial program 99.9%

      \[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. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 98.7

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

   5. Applied rewrites 98.7%

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

   if -0.050000000000000003 < (*.f64 (exp.f64 re) (cos.f64 im)) < 1e-13 or 0.999999999999999667 < (*.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.7%

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

Alternative 4: 99.1% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (cos im) (fma re (fma re 0.5 1.0) 1.0)))
        (t_1 (* (exp re) (cos im))))
   (if (<= t_1 (- INFINITY))
     (* (exp re) (fma im (* im -0.5) 1.0))
     (if (<= t_1 -0.05)
       t_0
       (if (<= t_1 1e-13)
         (exp re)
         (if (<= t_1 0.9999999999999997) t_0 (exp re)))))))

C

double code(double re, double im) {
	double t_0 = cos(im) * fma(re, fma(re, 0.5, 1.0), 1.0);
	double t_1 = exp(re) * cos(im);
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = exp(re) * fma(im, (im * -0.5), 1.0);
	} else if (t_1 <= -0.05) {
		tmp = t_0;
	} else if (t_1 <= 1e-13) {
		tmp = exp(re);
	} else if (t_1 <= 0.9999999999999997) {
		tmp = t_0;
	} else {
		tmp = exp(re);
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(cos(im) * fma(re, fma(re, 0.5, 1.0), 1.0))
	t_1 = Float64(exp(re) * cos(im))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(exp(re) * fma(im, Float64(im * -0.5), 1.0));
	elseif (t_1 <= -0.05)
		tmp = t_0;
	elseif (t_1 <= 1e-13)
		tmp = exp(re);
	elseif (t_1 <= 0.9999999999999997)
		tmp = t_0;
	else
		tmp = exp(re);
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Cos[im], $MachinePrecision] * N[(re * N[(re * 0.5 + 1.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Exp[re], $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[Exp[re], $MachinePrecision] * N[(im * N[(im * -0.5), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -0.05], t$95$0, If[LessEqual[t$95$1, 1e-13], N[Exp[re], $MachinePrecision], If[LessEqual[t$95$1, 0.9999999999999997], t$95$0, 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. unpow2 N/A

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

      3. associate-*r* N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 100.0

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

   5. Applied rewrites 100.0%

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

   if -inf.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < -0.050000000000000003 or 1e-13 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.999999999999999667

   1. Initial program 99.9%

      \[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. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 97.8

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

   5. Applied rewrites 97.8%

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

   if -0.050000000000000003 < (*.f64 (exp.f64 re) (cos.f64 im)) < 1e-13 or 0.999999999999999667 < (*.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.5%

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

Alternative 5: 98.7% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (cos im) (+ re 1.0))) (t_1 (* (exp re) (cos im))))
   (if (<= t_1 (- INFINITY))
     (* (exp re) (fma im (* im -0.5) 1.0))
     (if (<= t_1 -0.05)
       t_0
       (if (<= t_1 1e-13) (exp re) (if (<= t_1 0.9996) t_0 (exp re)))))))

C

double code(double re, double im) {
	double t_0 = cos(im) * (re + 1.0);
	double t_1 = exp(re) * cos(im);
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = exp(re) * fma(im, (im * -0.5), 1.0);
	} else if (t_1 <= -0.05) {
		tmp = t_0;
	} else if (t_1 <= 1e-13) {
		tmp = exp(re);
	} else if (t_1 <= 0.9996) {
		tmp = t_0;
	} else {
		tmp = exp(re);
	}
	return tmp;
}

Julia

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

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Cos[im], $MachinePrecision] * N[(re + 1.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Exp[re], $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[Exp[re], $MachinePrecision] * N[(im * N[(im * -0.5), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -0.05], t$95$0, If[LessEqual[t$95$1, 1e-13], N[Exp[re], $MachinePrecision], If[LessEqual[t$95$1, 0.9996], t$95$0, 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. unpow2 N/A

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

      3. associate-*r* N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 100.0

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

   5. Applied rewrites 100.0%

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

   if -inf.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < -0.050000000000000003 or 1e-13 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.99960000000000004

   1. Initial program 99.9%

      \[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. +-commutative N/A

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

      2. lower-+.f64 96.6

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

   5. Applied rewrites 96.6%

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

   if -0.050000000000000003 < (*.f64 (exp.f64 re) (cos.f64 im)) < 1e-13 or 0.99960000000000004 < (*.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 99.9

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

   5. Applied rewrites 99.9%

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

4. Final simplification 99.1%

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

Alternative 6: 98.1% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (exp re) (cos im))) (t_1 (* (cos im) (+ re 1.0))))
   (if (<= t_0 (- INFINITY))
     (*
      (fma im (* im -0.5) 1.0)
      (fma re (fma re (fma re 0.16666666666666666 0.5) 1.0) 1.0))
     (if (<= t_0 -0.05)
       t_1
       (if (<= t_0 1e-13) (exp re) (if (<= t_0 0.9996) t_1 (exp re)))))))

C

double code(double re, double im) {
	double t_0 = exp(re) * cos(im);
	double t_1 = cos(im) * (re + 1.0);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = fma(im, (im * -0.5), 1.0) * fma(re, fma(re, fma(re, 0.16666666666666666, 0.5), 1.0), 1.0);
	} else if (t_0 <= -0.05) {
		tmp = t_1;
	} else if (t_0 <= 1e-13) {
		tmp = exp(re);
	} else if (t_0 <= 0.9996) {
		tmp = t_1;
	} else {
		tmp = exp(re);
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(exp(re) * cos(im))
	t_1 = Float64(cos(im) * Float64(re + 1.0))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(fma(im, Float64(im * -0.5), 1.0) * fma(re, fma(re, fma(re, 0.16666666666666666, 0.5), 1.0), 1.0));
	elseif (t_0 <= -0.05)
		tmp = t_1;
	elseif (t_0 <= 1e-13)
		tmp = exp(re);
	elseif (t_0 <= 0.9996)
		tmp = t_1;
	else
		tmp = exp(re);
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Exp[re], $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Cos[im], $MachinePrecision] * N[(re + 1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[(im * N[(im * -0.5), $MachinePrecision] + 1.0), $MachinePrecision] * N[(re * N[(re * N[(re * 0.16666666666666666 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, -0.05], t$95$1, If[LessEqual[t$95$0, 1e-13], N[Exp[re], $MachinePrecision], If[LessEqual[t$95$0, 0.9996], 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. unpow2 N/A

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

      3. associate-*r* N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. 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 \mathsf{fma}\left(im, im \cdot \frac{-1}{2}, 1\right) \]
   7. 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 \mathsf{fma}\left(im, im \cdot \frac{-1}{2}, 1\right) \]

      2. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 94.3

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

   8. Applied rewrites 94.3%

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

   if -inf.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < -0.050000000000000003 or 1e-13 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.99960000000000004

   1. Initial program 99.9%

      \[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. +-commutative N/A

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

      2. lower-+.f64 96.6

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

   5. Applied rewrites 96.6%

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

   if -0.050000000000000003 < (*.f64 (exp.f64 re) (cos.f64 im)) < 1e-13 or 0.99960000000000004 < (*.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 99.9

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

   5. Applied rewrites 99.9%

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

4. Final simplification 98.8%

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

Alternative 7: 97.8% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (exp re) (cos im))))
   (if (<= t_0 (- INFINITY))
     (*
      (fma im (* im -0.5) 1.0)
      (fma re (fma re (fma re 0.16666666666666666 0.5) 1.0) 1.0))
     (if (<= t_0 -0.05)
       (cos im)
       (if (<= t_0 1e-13) (exp re) (if (<= t_0 0.9996) (cos im) (exp re)))))))

C

double code(double re, double im) {
	double t_0 = exp(re) * cos(im);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = fma(im, (im * -0.5), 1.0) * fma(re, fma(re, fma(re, 0.16666666666666666, 0.5), 1.0), 1.0);
	} else if (t_0 <= -0.05) {
		tmp = cos(im);
	} else if (t_0 <= 1e-13) {
		tmp = exp(re);
	} else if (t_0 <= 0.9996) {
		tmp = cos(im);
	} else {
		tmp = exp(re);
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(exp(re) * cos(im))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(fma(im, Float64(im * -0.5), 1.0) * fma(re, fma(re, fma(re, 0.16666666666666666, 0.5), 1.0), 1.0));
	elseif (t_0 <= -0.05)
		tmp = cos(im);
	elseif (t_0 <= 1e-13)
		tmp = exp(re);
	elseif (t_0 <= 0.9996)
		tmp = cos(im);
	else
		tmp = exp(re);
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Exp[re], $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[(im * N[(im * -0.5), $MachinePrecision] + 1.0), $MachinePrecision] * N[(re * N[(re * N[(re * 0.16666666666666666 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, -0.05], N[Cos[im], $MachinePrecision], If[LessEqual[t$95$0, 1e-13], N[Exp[re], $MachinePrecision], If[LessEqual[t$95$0, 0.9996], 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. unpow2 N/A

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

      3. associate-*r* N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. 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 \mathsf{fma}\left(im, im \cdot \frac{-1}{2}, 1\right) \]
   7. 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 \mathsf{fma}\left(im, im \cdot \frac{-1}{2}, 1\right) \]

      2. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 94.3

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

   8. Applied rewrites 94.3%

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

   if -inf.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < -0.050000000000000003 or 1e-13 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.99960000000000004

   1. Initial program 99.9%

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

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

   5. Applied rewrites 95.4%

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

   if -0.050000000000000003 < (*.f64 (exp.f64 re) (cos.f64 im)) < 1e-13 or 0.99960000000000004 < (*.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 99.9

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

   5. Applied rewrites 99.9%

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

4. Final simplification 98.5%

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

Alternative 8: 76.9% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (exp re) (cos im))))
   (if (<= t_0 (- INFINITY))
     (*
      (fma im (* im -0.5) 1.0)
      (fma re (fma re (fma re 0.16666666666666666 0.5) 1.0) 1.0))
     (if (<= t_0 -0.05)
       (cos im)
       (if (<= t_0 4e-162)
         (* im (* im (* im (* im 0.041666666666666664))))
         (if (<= t_0 0.9996)
           (cos im)
           (*
            (fma re (fma re 0.5 1.0) 1.0)
            (fma
             (* im im)
             (fma (* im im) 0.041666666666666664 -0.5)
             1.0))))))))

C

double code(double re, double im) {
	double t_0 = exp(re) * cos(im);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = fma(im, (im * -0.5), 1.0) * fma(re, fma(re, fma(re, 0.16666666666666666, 0.5), 1.0), 1.0);
	} else if (t_0 <= -0.05) {
		tmp = cos(im);
	} else if (t_0 <= 4e-162) {
		tmp = im * (im * (im * (im * 0.041666666666666664)));
	} else if (t_0 <= 0.9996) {
		tmp = cos(im);
	} else {
		tmp = fma(re, fma(re, 0.5, 1.0), 1.0) * fma((im * im), fma((im * im), 0.041666666666666664, -0.5), 1.0);
	}
	return tmp;
}

Julia

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

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Exp[re], $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[(im * N[(im * -0.5), $MachinePrecision] + 1.0), $MachinePrecision] * N[(re * N[(re * N[(re * 0.16666666666666666 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, -0.05], N[Cos[im], $MachinePrecision], If[LessEqual[t$95$0, 4e-162], N[(im * N[(im * N[(im * N[(im * 0.041666666666666664), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 0.9996], N[Cos[im], $MachinePrecision], N[(N[(re * N[(re * 0.5 + 1.0), $MachinePrecision] + 1.0), $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * 0.041666666666666664 + -0.5), $MachinePrecision] + 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. unpow2 N/A

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

      3. associate-*r* N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. 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 \mathsf{fma}\left(im, im \cdot \frac{-1}{2}, 1\right) \]
   7. 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 \mathsf{fma}\left(im, im \cdot \frac{-1}{2}, 1\right) \]

      2. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 94.3

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

   8. Applied rewrites 94.3%

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

   if -inf.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < -0.050000000000000003 or 3.99999999999999982e-162 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.99960000000000004

   1. Initial program 99.9%

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

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

   5. Applied rewrites 94.0%

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

   if -0.050000000000000003 < (*.f64 (exp.f64 re) (cos.f64 im)) < 3.99999999999999982e-162

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

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

   5. Applied rewrites 3.2%

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

      \[\leadsto \mathsf{fma}\left(im \cdot im, \color{blue}{\mathsf{fma}\left(im \cdot im, 0.041666666666666664, -0.5\right)}, 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 34.0%

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

   if 0.99960000000000004 < (*.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 + \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. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 80.6

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

   5. Applied rewrites 80.6%

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

   6. Taylor expanded in im around 0

      \[\leadsto \mathsf{fma}\left(re, \mathsf{fma}\left(re, \frac{1}{2}, 1\right), 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(re, \mathsf{fma}\left(re, \frac{1}{2}, 1\right), 1\right) \cdot \color{blue}{\left({im}^{2} \cdot \left(\frac{1}{24} \cdot {im}^{2} - \frac{1}{2}\right) + 1\right)} \]

      2. lower-fma.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. sub-neg N/A

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

      6. *-commutative N/A

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

      7. metadata-eval N/A

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

      8. lower-fma.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 87.3

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

   8. Applied rewrites 87.3%

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

4. Final simplification 75.8%

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

Alternative 9: 56.3% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (exp re) (cos im)))
        (t_1 (fma re (fma re (fma re 0.16666666666666666 0.5) 1.0) 1.0)))
   (if (<= t_0 -0.05)
     (* (fma im (* im -0.5) 1.0) t_1)
     (if (<= t_0 1e-13)
       (* im (* im (* im (* im 0.041666666666666664))))
       t_1))))

C

double code(double re, double im) {
	double t_0 = exp(re) * cos(im);
	double t_1 = fma(re, fma(re, fma(re, 0.16666666666666666, 0.5), 1.0), 1.0);
	double tmp;
	if (t_0 <= -0.05) {
		tmp = fma(im, (im * -0.5), 1.0) * t_1;
	} else if (t_0 <= 1e-13) {
		tmp = im * (im * (im * (im * 0.041666666666666664)));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   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. unpow2 N/A

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

      3. associate-*r* N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 42.9

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

   5. Applied rewrites 42.9%

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

   6. 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 \mathsf{fma}\left(im, im \cdot \frac{-1}{2}, 1\right) \]
   7. 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 \mathsf{fma}\left(im, im \cdot \frac{-1}{2}, 1\right) \]

      2. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 40.6

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

   8. Applied rewrites 40.6%

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

   if -0.050000000000000003 < (*.f64 (exp.f64 re) (cos.f64 im)) < 1e-13

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

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

   5. Applied rewrites 3.3%

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

      \[\leadsto \mathsf{fma}\left(im \cdot im, \color{blue}{\mathsf{fma}\left(im \cdot im, 0.041666666666666664, -0.5\right)}, 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 33.5%

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

   if 1e-13 < (*.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 80.5

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

   5. Applied rewrites 80.5%

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

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

4. Final simplification 55.8%

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

Alternative 10: 55.8% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (exp re) (cos im))))
   (if (<= t_0 -0.05)
     (fma
      (* im im)
      (fma
       im
       (* im (fma (* im im) -0.001388888888888889 0.041666666666666664))
       -0.5)
      1.0)
     (if (<= t_0 1e-13)
       (* im (* im (* im (* im 0.041666666666666664))))
       (fma re (fma re (fma re 0.16666666666666666 0.5) 1.0) 1.0)))))

C

double code(double re, double im) {
	double t_0 = exp(re) * cos(im);
	double tmp;
	if (t_0 <= -0.05) {
		tmp = fma((im * im), fma(im, (im * fma((im * im), -0.001388888888888889, 0.041666666666666664)), -0.5), 1.0);
	} else if (t_0 <= 1e-13) {
		tmp = im * (im * (im * (im * 0.041666666666666664)));
	} else {
		tmp = fma(re, fma(re, fma(re, 0.16666666666666666, 0.5), 1.0), 1.0);
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 99.9%

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

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

   5. Applied rewrites 57.4%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 40.0%

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

   if -0.050000000000000003 < (*.f64 (exp.f64 re) (cos.f64 im)) < 1e-13

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

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

   5. Applied rewrites 3.3%

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

      \[\leadsto \mathsf{fma}\left(im \cdot im, \color{blue}{\mathsf{fma}\left(im \cdot im, 0.041666666666666664, -0.5\right)}, 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 33.5%

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

   if 1e-13 < (*.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 80.5

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

   5. Applied rewrites 80.5%

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

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

Alternative 11: 55.8% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (exp re) (cos im))))
   (if (<= t_0 -0.05)
     (fma
      (* im im)
      (fma im (* im (* (* im im) -0.001388888888888889)) -0.5)
      1.0)
     (if (<= t_0 1e-13)
       (* im (* im (* im (* im 0.041666666666666664))))
       (fma re (fma re (fma re 0.16666666666666666 0.5) 1.0) 1.0)))))

C

double code(double re, double im) {
	double t_0 = exp(re) * cos(im);
	double tmp;
	if (t_0 <= -0.05) {
		tmp = fma((im * im), fma(im, (im * ((im * im) * -0.001388888888888889)), -0.5), 1.0);
	} else if (t_0 <= 1e-13) {
		tmp = im * (im * (im * (im * 0.041666666666666664)));
	} else {
		tmp = fma(re, fma(re, fma(re, 0.16666666666666666, 0.5), 1.0), 1.0);
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 99.9%

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

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

   5. Applied rewrites 57.4%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 40.0%

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

   9. Taylor expanded in im around inf

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

   11. Applied rewrites 40.0%

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

   if -0.050000000000000003 < (*.f64 (exp.f64 re) (cos.f64 im)) < 1e-13

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

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

   5. Applied rewrites 3.3%

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

      \[\leadsto \mathsf{fma}\left(im \cdot im, \color{blue}{\mathsf{fma}\left(im \cdot im, 0.041666666666666664, -0.5\right)}, 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 33.5%

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

   if 1e-13 < (*.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 80.5

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

   5. Applied rewrites 80.5%

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

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

Alternative 12: 56.0% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (exp re) (cos im))))
   (if (<= t_0 -0.05)
     (* (fma im (* im -0.5) 1.0) (fma re (fma re 0.5 1.0) 1.0))
     (if (<= t_0 1e-13)
       (* im (* im (* im (* im 0.041666666666666664))))
       (fma re (fma re (fma re 0.16666666666666666 0.5) 1.0) 1.0)))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   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. unpow2 N/A

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

      3. associate-*r* N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 42.9

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

   5. Applied rewrites 42.9%

      \[\leadsto e^{re} \cdot \color{blue}{\mathsf{fma}\left(im, im \cdot -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, im \cdot \frac{-1}{2}, 1\right) \]
   7. 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 \mathsf{fma}\left(im, im \cdot \frac{-1}{2}, 1\right) \]

      2. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 36.0

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

   8. Applied rewrites 36.0%

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

   if -0.050000000000000003 < (*.f64 (exp.f64 re) (cos.f64 im)) < 1e-13

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

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

   5. Applied rewrites 3.3%

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

      \[\leadsto \mathsf{fma}\left(im \cdot im, \color{blue}{\mathsf{fma}\left(im \cdot im, 0.041666666666666664, -0.5\right)}, 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 33.5%

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

   if 1e-13 < (*.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 80.5

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

   5. Applied rewrites 80.5%

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

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

4. Final simplification 55.1%

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

Alternative 13: 55.4% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (exp re) (cos im))))
   (if (<= t_0 -0.05)
     (* (fma im (* im -0.5) 1.0) (+ re 1.0))
     (if (<= t_0 1e-13)
       (* im (* im (* im (* im 0.041666666666666664))))
       (fma re (fma re (fma re 0.16666666666666666 0.5) 1.0) 1.0)))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   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. unpow2 N/A

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

      3. associate-*r* N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 42.9

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

   5. Applied rewrites 42.9%

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

   6. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 33.5

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

   8. Applied rewrites 33.5%

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

   if -0.050000000000000003 < (*.f64 (exp.f64 re) (cos.f64 im)) < 1e-13

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

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

   5. Applied rewrites 3.3%

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

      \[\leadsto \mathsf{fma}\left(im \cdot im, \color{blue}{\mathsf{fma}\left(im \cdot im, 0.041666666666666664, -0.5\right)}, 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 33.5%

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

   if 1e-13 < (*.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 80.5

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

   5. Applied rewrites 80.5%

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

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

4. Final simplification 54.7%

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

Alternative 14: 41.2% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < 1e-13

   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 23.7

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

   5. Applied rewrites 23.7%

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

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

   if 1e-13 < (*.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 70.1

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

   5. Applied rewrites 70.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 69.1%

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

   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 57.9%

      \[\leadsto \mathsf{fma}\left(re, \color{blue}{\mathsf{fma}\left(re, 0.5, 1\right)}, 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 57.9%

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

Alternative 15: 45.7% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < 1e-13

   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. unpow2 N/A

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

      3. associate-*r* N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 64.3

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

   5. Applied rewrites 64.3%

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

   6. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 13.8

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

   8. Applied rewrites 13.8%

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

   if 1e-13 < (*.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 80.5

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

   5. Applied rewrites 80.5%

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

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

4. Final simplification 46.6%

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

Alternative 16: 44.3% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < 1e-13

   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 23.7

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

   5. Applied rewrites 23.7%

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

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

   if 1e-13 < (*.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 80.5

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

   5. Applied rewrites 80.5%

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

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

Alternative 17: 41.3% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < 1e-13

   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 23.7

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

   5. Applied rewrites 23.7%

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

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

   if 1e-13 < (*.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 80.5

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

   5. Applied rewrites 80.5%

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

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

Alternative 18: 37.5% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[re_, im_] := If[LessEqual[N[(N[Exp[re], $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision], 2.0], N[(re + 1.0), $MachinePrecision], N[(0.5 * N[(re * re), $MachinePrecision]), $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 66.2

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

   5. Applied rewrites 66.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 34.1%

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

   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 57.9%

      \[\leadsto \mathsf{fma}\left(re, \color{blue}{\mathsf{fma}\left(re, 0.5, 1\right)}, 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 57.9%

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

Alternative 19: 28.6% accurate, 51.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[re_, im_] := N[(re + 1.0), $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.1

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

5. Applied rewrites 73.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 28.4%

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

Alternative 20: 28.2% 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.1

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

5. Applied rewrites 73.1%

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

6. Taylor expanded in re around 0

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

8. Applied rewrites 27.4%

   \[\leadsto 1 \]
9. Add Preprocessing

Reproduce

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