math.exp on complex, real part

Percentage Accurate: 100.0% → 100.0%

Time: 14.8s

Alternatives: 19

Speedup: 1.0×

• 24.8% 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 := \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.02:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq 0:\\ \;\;\;\;e^{re}\\ \mathbf{elif}\;t\_1 \leq 0.9999999999995:\\ \;\;\;\;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.02)
       t_0
       (if (<= t_1 0.0)
         (exp re)
         (if (<= t_1 0.9999999999995) 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.02) {
		tmp = t_0;
	} else if (t_1 <= 0.0) {
		tmp = exp(re);
	} else if (t_1 <= 0.9999999999995) {
		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.02)
		tmp = t_0;
	elseif (t_1 <= 0.0)
		tmp = exp(re);
	elseif (t_1 <= 0.9999999999995)
		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.02], t$95$0, If[LessEqual[t$95$1, 0.0], N[Exp[re], $MachinePrecision], If[LessEqual[t$95$1, 0.9999999999995], 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.0200000000000000004 or 0.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.99999999999949996

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 100.0

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

   5. Applied rewrites 100.0%

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

   if -0.0200000000000000004 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.0 or 0.99999999999949996 < (*.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 100.0%

   \[\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.02:\\ \;\;\;\;\cos im \cdot \left(re + 1\right)\\ \mathbf{elif}\;e^{re} \cdot \cos im \leq 0:\\ \;\;\;\;e^{re}\\ \mathbf{elif}\;e^{re} \cdot \cos im \leq 0.9999999999995:\\ \;\;\;\;\cos im \cdot \left(re + 1\right)\\ \mathbf{else}:\\ \;\;\;\;e^{re}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 98.3% 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 \cdot im, \mathsf{fma}\left(im \cdot im, \mathsf{fma}\left(im, im \cdot -0.001388888888888889, 0.041666666666666664\right), -0.5\right), 1\right)\\ \mathbf{elif}\;t\_0 \leq -0.02:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 \leq 0:\\ \;\;\;\;e^{re}\\ \mathbf{elif}\;t\_0 \leq 0.9999999999995:\\ \;\;\;\;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)
      (fma
       (* im im)
       (fma im (* im -0.001388888888888889) 0.041666666666666664)
       -0.5)
      1.0)
     (if (<= t_0 -0.02)
       t_1
       (if (<= t_0 0.0)
         (exp re)
         (if (<= t_0 0.9999999999995) 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), fma((im * im), fma(im, (im * -0.001388888888888889), 0.041666666666666664), -0.5), 1.0);
	} else if (t_0 <= -0.02) {
		tmp = t_1;
	} else if (t_0 <= 0.0) {
		tmp = exp(re);
	} else if (t_0 <= 0.9999999999995) {
		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 = fma(Float64(im * im), fma(Float64(im * im), fma(im, Float64(im * -0.001388888888888889), 0.041666666666666664), -0.5), 1.0);
	elseif (t_0 <= -0.02)
		tmp = t_1;
	elseif (t_0 <= 0.0)
		tmp = exp(re);
	elseif (t_0 <= 0.9999999999995)
		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 * im), $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * N[(im * N[(im * -0.001388888888888889), $MachinePrecision] + 0.041666666666666664), $MachinePrecision] + -0.5), $MachinePrecision] + 1.0), $MachinePrecision], If[LessEqual[t$95$0, -0.02], t$95$1, If[LessEqual[t$95$0, 0.0], N[Exp[re], $MachinePrecision], If[LessEqual[t$95$0, 0.9999999999995], 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 re around 0

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

      1. lower-cos.f64 3.1

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

   5. Applied rewrites 3.1%

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

   6. Taylor expanded in im around 0

      \[\leadsto 1 + \color{blue}{{im}^{2} \cdot \left({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 95.1%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 100.0

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

   5. Applied rewrites 100.0%

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

   if -0.0200000000000000004 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.0 or 0.99999999999949996 < (*.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.6%

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

Alternative 4: 97.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 \cdot im, \mathsf{fma}\left(im \cdot im, \mathsf{fma}\left(im, im \cdot -0.001388888888888889, 0.041666666666666664\right), -0.5\right), 1\right)\\ \mathbf{elif}\;t\_0 \leq -0.02:\\ \;\;\;\;\cos im\\ \mathbf{elif}\;t\_0 \leq 0:\\ \;\;\;\;e^{re}\\ \mathbf{elif}\;t\_0 \leq 0.9999999999995:\\ \;\;\;\;\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)
      (fma
       (* im im)
       (fma im (* im -0.001388888888888889) 0.041666666666666664)
       -0.5)
      1.0)
     (if (<= t_0 -0.02)
       (cos im)
       (if (<= t_0 0.0)
         (exp re)
         (if (<= t_0 0.9999999999995) (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), fma((im * im), fma(im, (im * -0.001388888888888889), 0.041666666666666664), -0.5), 1.0);
	} else if (t_0 <= -0.02) {
		tmp = cos(im);
	} else if (t_0 <= 0.0) {
		tmp = exp(re);
	} else if (t_0 <= 0.9999999999995) {
		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 = fma(Float64(im * im), fma(Float64(im * im), fma(im, Float64(im * -0.001388888888888889), 0.041666666666666664), -0.5), 1.0);
	elseif (t_0 <= -0.02)
		tmp = cos(im);
	elseif (t_0 <= 0.0)
		tmp = exp(re);
	elseif (t_0 <= 0.9999999999995)
		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 * im), $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * N[(im * N[(im * -0.001388888888888889), $MachinePrecision] + 0.041666666666666664), $MachinePrecision] + -0.5), $MachinePrecision] + 1.0), $MachinePrecision], If[LessEqual[t$95$0, -0.02], N[Cos[im], $MachinePrecision], If[LessEqual[t$95$0, 0.0], N[Exp[re], $MachinePrecision], If[LessEqual[t$95$0, 0.9999999999995], 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 re around 0

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

      1. lower-cos.f64 3.1

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

   5. Applied rewrites 3.1%

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

   6. Taylor expanded in im around 0

      \[\leadsto 1 + \color{blue}{{im}^{2} \cdot \left({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 95.1%

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

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

   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 99.6

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

   5. Applied rewrites 99.6%

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

   if -0.0200000000000000004 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.0 or 0.99999999999949996 < (*.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. Add Preprocessing

Alternative 5: 85.2% 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 \cdot im, \mathsf{fma}\left(im \cdot im, \mathsf{fma}\left(im, im \cdot -0.001388888888888889, 0.041666666666666664\right), -0.5\right), 1\right)\\ \mathbf{elif}\;t\_0 \leq -0.02:\\ \;\;\;\;\cos im\\ \mathbf{elif}\;t\_0 \leq 0:\\ \;\;\;\;\frac{1}{\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 2:\\ \;\;\;\;\cos im\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\left(re \cdot re\right) \cdot \mathsf{fma}\left(re \cdot re, 0.027777777777777776, -0.25\right), \frac{1}{\mathsf{fma}\left(re, 0.16666666666666666, -0.5\right)}, re\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)
      (fma
       (* im im)
       (fma im (* im -0.001388888888888889) 0.041666666666666664)
       -0.5)
      1.0)
     (if (<= t_0 -0.02)
       (cos im)
       (if (<= t_0 0.0)
         (/ 1.0 (fma re (fma re (fma re -0.16666666666666666 0.5) -1.0) 1.0))
         (if (<= t_0 2.0)
           (cos im)
           (fma
            (* (* re re) (fma (* re re) 0.027777777777777776 -0.25))
            (/ 1.0 (fma re 0.16666666666666666 -0.5))
            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), fma((im * im), fma(im, (im * -0.001388888888888889), 0.041666666666666664), -0.5), 1.0);
	} else if (t_0 <= -0.02) {
		tmp = cos(im);
	} else if (t_0 <= 0.0) {
		tmp = 1.0 / fma(re, fma(re, fma(re, -0.16666666666666666, 0.5), -1.0), 1.0);
	} else if (t_0 <= 2.0) {
		tmp = cos(im);
	} else {
		tmp = fma(((re * re) * fma((re * re), 0.027777777777777776, -0.25)), (1.0 / fma(re, 0.16666666666666666, -0.5)), re);
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(exp(re) * cos(im))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = fma(Float64(im * im), fma(Float64(im * im), fma(im, Float64(im * -0.001388888888888889), 0.041666666666666664), -0.5), 1.0);
	elseif (t_0 <= -0.02)
		tmp = cos(im);
	elseif (t_0 <= 0.0)
		tmp = Float64(1.0 / fma(re, fma(re, fma(re, -0.16666666666666666, 0.5), -1.0), 1.0));
	elseif (t_0 <= 2.0)
		tmp = cos(im);
	else
		tmp = fma(Float64(Float64(re * re) * fma(Float64(re * re), 0.027777777777777776, -0.25)), Float64(1.0 / fma(re, 0.16666666666666666, -0.5)), 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 * im), $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * N[(im * N[(im * -0.001388888888888889), $MachinePrecision] + 0.041666666666666664), $MachinePrecision] + -0.5), $MachinePrecision] + 1.0), $MachinePrecision], If[LessEqual[t$95$0, -0.02], N[Cos[im], $MachinePrecision], If[LessEqual[t$95$0, 0.0], N[(1.0 / N[(re * N[(re * N[(re * -0.16666666666666666 + 0.5), $MachinePrecision] + -1.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2.0], N[Cos[im], $MachinePrecision], N[(N[(N[(re * re), $MachinePrecision] * N[(N[(re * re), $MachinePrecision] * 0.027777777777777776 + -0.25), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(re * 0.16666666666666666 + -0.5), $MachinePrecision]), $MachinePrecision] + 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 re around 0

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

      1. lower-cos.f64 3.1

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

   5. Applied rewrites 3.1%

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

   6. Taylor expanded in im around 0

      \[\leadsto 1 + \color{blue}{{im}^{2} \cdot \left({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 95.1%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-cos.f64 99.7

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

   5. Applied rewrites 99.7%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in 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 + re \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot re\right)\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 1.9%

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

   10. Applied rewrites 1.9%

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

   11. Taylor expanded in re around 0

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

   13. Applied rewrites 57.0%

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

   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 + re \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot re\right)\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 66.8%

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

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 66.8%

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

   13. Applied rewrites 82.1%

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

4. Final simplification 85.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{re} \cdot \cos im \leq -\infty:\\ \;\;\;\;\mathsf{fma}\left(im \cdot im, \mathsf{fma}\left(im \cdot im, \mathsf{fma}\left(im, im \cdot -0.001388888888888889, 0.041666666666666664\right), -0.5\right), 1\right)\\ \mathbf{elif}\;e^{re} \cdot \cos im \leq -0.02:\\ \;\;\;\;\cos im\\ \mathbf{elif}\;e^{re} \cdot \cos im \leq 0:\\ \;\;\;\;\frac{1}{\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 2:\\ \;\;\;\;\cos im\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\left(re \cdot re\right) \cdot \mathsf{fma}\left(re \cdot re, 0.027777777777777776, -0.25\right), \frac{1}{\mathsf{fma}\left(re, 0.16666666666666666, -0.5\right)}, re\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 63.6% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (exp re) (cos im))))
   (if (<= t_0 -0.02)
     (fma
      (* im im)
      (fma
       (* im im)
       (fma im (* im -0.001388888888888889) 0.041666666666666664)
       -0.5)
      1.0)
     (if (<= t_0 2.0)
       (/ 1.0 (fma re (fma re (fma re -0.16666666666666666 0.5) -1.0) 1.0))
       (fma
        (* (* re re) (fma (* re re) 0.027777777777777776 -0.25))
        (/ 1.0 (fma re 0.16666666666666666 -0.5))
        re)))))

C

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

Julia

function code(re, im)
	t_0 = Float64(exp(re) * cos(im))
	tmp = 0.0
	if (t_0 <= -0.02)
		tmp = fma(Float64(im * im), fma(Float64(im * im), fma(im, Float64(im * -0.001388888888888889), 0.041666666666666664), -0.5), 1.0);
	elseif (t_0 <= 2.0)
		tmp = Float64(1.0 / fma(re, fma(re, fma(re, -0.16666666666666666, 0.5), -1.0), 1.0));
	else
		tmp = fma(Float64(Float64(re * re) * fma(Float64(re * re), 0.027777777777777776, -0.25)), Float64(1.0 / fma(re, 0.16666666666666666, -0.5)), 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, -0.02], N[(N[(im * im), $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * N[(im * N[(im * -0.001388888888888889), $MachinePrecision] + 0.041666666666666664), $MachinePrecision] + -0.5), $MachinePrecision] + 1.0), $MachinePrecision], If[LessEqual[t$95$0, 2.0], N[(1.0 / N[(re * N[(re * N[(re * -0.16666666666666666 + 0.5), $MachinePrecision] + -1.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(re * re), $MachinePrecision] * N[(N[(re * re), $MachinePrecision] * 0.027777777777777776 + -0.25), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(re * 0.16666666666666666 + -0.5), $MachinePrecision]), $MachinePrecision] + re), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   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 67.4

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

   5. Applied rewrites 67.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 34.5%

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

   if -0.0200000000000000004 < (*.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 87.1

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

   5. Applied rewrites 87.1%

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

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

   10. Applied rewrites 45.5%

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

   11. Taylor expanded in re around 0

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

   13. Applied rewrites 68.9%

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

   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 + re \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot re\right)\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 66.8%

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

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 66.8%

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

   13. Applied rewrites 82.1%

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

4. Final simplification 63.7%

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

Alternative 7: 62.1% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

function code(re, im)
	t_0 = Float64(exp(re) * cos(im))
	tmp = 0.0
	if (t_0 <= -0.02)
		tmp = fma(Float64(im * im), fma(Float64(im * im), fma(im, Float64(im * -0.001388888888888889), 0.041666666666666664), -0.5), 1.0);
	elseif (t_0 <= 2.0)
		tmp = Float64(1.0 / fma(re, fma(re, fma(re, -0.16666666666666666, 0.5), -1.0), 1.0));
	else
		tmp = Float64(re * Float64(0.16666666666666666 * 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, -0.02], N[(N[(im * im), $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * N[(im * N[(im * -0.001388888888888889), $MachinePrecision] + 0.041666666666666664), $MachinePrecision] + -0.5), $MachinePrecision] + 1.0), $MachinePrecision], If[LessEqual[t$95$0, 2.0], N[(1.0 / N[(re * N[(re * N[(re * -0.16666666666666666 + 0.5), $MachinePrecision] + -1.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(re * N[(0.16666666666666666 * N[(re * re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   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 67.4

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

   5. Applied rewrites 67.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 34.5%

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

   if -0.0200000000000000004 < (*.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 87.1

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

   5. Applied rewrites 87.1%

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

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

   10. Applied rewrites 45.5%

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

   11. Taylor expanded in re around 0

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

   13. Applied rewrites 68.9%

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

   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 + re \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot re\right)\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 66.8%

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

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 66.8%

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

Alternative 8: 62.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.02:\\ \;\;\;\;\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 2:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(re, \mathsf{fma}\left(re, \mathsf{fma}\left(re, -0.16666666666666666, 0.5\right), -1\right), 1\right)}\\ \mathbf{else}:\\ \;\;\;\;re \cdot \left(0.16666666666666666 \cdot \left(re \cdot re\right)\right)\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

function code(re, im)
	t_0 = Float64(exp(re) * cos(im))
	tmp = 0.0
	if (t_0 <= -0.02)
		tmp = Float64(fma(im, Float64(im * -0.5), 1.0) * fma(re, fma(re, 0.5, 1.0), 1.0));
	elseif (t_0 <= 2.0)
		tmp = Float64(1.0 / fma(re, fma(re, fma(re, -0.16666666666666666, 0.5), -1.0), 1.0));
	else
		tmp = Float64(re * Float64(0.16666666666666666 * 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, -0.02], 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, 2.0], N[(1.0 / N[(re * N[(re * N[(re * -0.16666666666666666 + 0.5), $MachinePrecision] + -1.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(re * N[(0.16666666666666666 * N[(re * re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   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 36.6

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

   5. Applied rewrites 36.6%

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

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

      \[\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.0200000000000000004 < (*.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 87.1

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

   5. Applied rewrites 87.1%

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

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

   10. Applied rewrites 45.5%

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

   11. Taylor expanded in re around 0

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

   13. Applied rewrites 68.9%

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

   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 + re \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot re\right)\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 66.8%

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

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 66.8%

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

4. Final simplification 60.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{re} \cdot \cos im \leq -0.02:\\ \;\;\;\;\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 2:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(re, \mathsf{fma}\left(re, \mathsf{fma}\left(re, -0.16666666666666666, 0.5\right), -1\right), 1\right)}\\ \mathbf{else}:\\ \;\;\;\;re \cdot \left(0.16666666666666666 \cdot \left(re \cdot re\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 58.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := e^{re} \cdot \cos im\\ \mathbf{if}\;t\_0 \leq -0.02:\\ \;\;\;\;\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 2:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(re, \mathsf{fma}\left(re, 0.5, -1\right), 1\right)}\\ \mathbf{else}:\\ \;\;\;\;re \cdot \left(0.16666666666666666 \cdot \left(re \cdot re\right)\right)\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

function code(re, im)
	t_0 = Float64(exp(re) * cos(im))
	tmp = 0.0
	if (t_0 <= -0.02)
		tmp = Float64(fma(im, Float64(im * -0.5), 1.0) * fma(re, fma(re, 0.5, 1.0), 1.0));
	elseif (t_0 <= 2.0)
		tmp = Float64(1.0 / fma(re, fma(re, 0.5, -1.0), 1.0));
	else
		tmp = Float64(re * Float64(0.16666666666666666 * 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, -0.02], 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, 2.0], N[(1.0 / N[(re * N[(re * 0.5 + -1.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(re * N[(0.16666666666666666 * N[(re * re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   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 36.6

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

   5. Applied rewrites 36.6%

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

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

      \[\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.0200000000000000004 < (*.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 87.1

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

   5. Applied rewrites 87.1%

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

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

   10. Applied rewrites 45.5%

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

   11. Taylor expanded in re around 0

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

   13. Applied rewrites 62.7%

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

   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 + re \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot re\right)\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 66.8%

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

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 66.8%

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

4. Final simplification 56.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{re} \cdot \cos im \leq -0.02:\\ \;\;\;\;\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 2:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(re, \mathsf{fma}\left(re, 0.5, -1\right), 1\right)}\\ \mathbf{else}:\\ \;\;\;\;re \cdot \left(0.16666666666666666 \cdot \left(re \cdot re\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 57.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.02:\\ \;\;\;\;\mathsf{fma}\left(im \cdot im, \left(im \cdot im\right) \cdot 0.25, -1\right) \cdot -1\\ \mathbf{elif}\;t\_0 \leq 2:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(re, \mathsf{fma}\left(re, 0.5, -1\right), 1\right)}\\ \mathbf{else}:\\ \;\;\;\;re \cdot \left(0.16666666666666666 \cdot \left(re \cdot re\right)\right)\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

function code(re, im)
	t_0 = Float64(exp(re) * cos(im))
	tmp = 0.0
	if (t_0 <= -0.02)
		tmp = Float64(fma(Float64(im * im), Float64(Float64(im * im) * 0.25), -1.0) * -1.0);
	elseif (t_0 <= 2.0)
		tmp = Float64(1.0 / fma(re, fma(re, 0.5, -1.0), 1.0));
	else
		tmp = Float64(re * Float64(0.16666666666666666 * 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, -0.02], N[(N[(N[(im * im), $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * 0.25), $MachinePrecision] + -1.0), $MachinePrecision] * -1.0), $MachinePrecision], If[LessEqual[t$95$0, 2.0], N[(1.0 / N[(re * N[(re * 0.5 + -1.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(re * N[(0.16666666666666666 * N[(re * re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   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 67.4

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

   5. Applied rewrites 67.4%

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

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

   10. Applied rewrites 14.6%

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

   11. Taylor expanded in im around 0

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

   13. Applied rewrites 32.9%

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

   if -0.0200000000000000004 < (*.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 87.1

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

   5. Applied rewrites 87.1%

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

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

   10. Applied rewrites 45.5%

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

   11. Taylor expanded in re around 0

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

   13. Applied rewrites 62.7%

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

   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 + re \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot re\right)\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 66.8%

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

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 66.8%

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

Alternative 11: 57.5% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

function code(re, im)
	t_0 = Float64(exp(re) * cos(im))
	tmp = 0.0
	if (t_0 <= -0.02)
		tmp = Float64(fma(im, Float64(im * -0.5), 1.0) * Float64(re + 1.0));
	elseif (t_0 <= 2.0)
		tmp = Float64(1.0 / fma(re, fma(re, 0.5, -1.0), 1.0));
	else
		tmp = Float64(re * Float64(0.16666666666666666 * 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, -0.02], N[(N[(im * N[(im * -0.5), $MachinePrecision] + 1.0), $MachinePrecision] * N[(re + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2.0], N[(1.0 / N[(re * N[(re * 0.5 + -1.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(re * N[(0.16666666666666666 * N[(re * re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   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 36.6

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

   5. Applied rewrites 36.6%

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

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

   8. Applied rewrites 30.0%

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

   if -0.0200000000000000004 < (*.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 87.1

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

   5. Applied rewrites 87.1%

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

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

   10. Applied rewrites 45.5%

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

   11. Taylor expanded in re around 0

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

   13. Applied rewrites 62.7%

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

   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 + re \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot re\right)\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 66.8%

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

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 66.8%

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

4. Final simplification 56.2%

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

Alternative 12: 51.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := e^{re} \cdot \cos im\\ \mathbf{if}\;t\_0 \leq -0.48:\\ \;\;\;\;\mathsf{fma}\left(im, im \cdot -0.5, 1\right) \cdot \left(re + 1\right)\\ \mathbf{elif}\;t\_0 \leq 0:\\ \;\;\;\;im \cdot \left(im \cdot -0.5\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.48)
     (* (fma im (* im -0.5) 1.0) (+ re 1.0))
     (if (<= t_0 0.0)
       (* im (* im -0.5))
       (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.48) {
		tmp = fma(im, (im * -0.5), 1.0) * (re + 1.0);
	} else if (t_0 <= 0.0) {
		tmp = im * (im * -0.5);
	} 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.48)
		tmp = Float64(fma(im, Float64(im * -0.5), 1.0) * Float64(re + 1.0));
	elseif (t_0 <= 0.0)
		tmp = Float64(im * Float64(im * -0.5));
	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.48], N[(N[(im * N[(im * -0.5), $MachinePrecision] + 1.0), $MachinePrecision] * N[(re + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 0.0], N[(im * N[(im * -0.5), $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.47999999999999998

   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 43.5

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

   5. Applied rewrites 43.5%

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

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

   8. Applied rewrites 35.6%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-cos.f64 16.2

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

   5. Applied rewrites 16.2%

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

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

   9. Taylor expanded in im around inf

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

   11. Applied rewrites 27.9%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lower-exp.f64 85.6

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

   5. Applied rewrites 85.6%

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

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{re} \cdot \cos im \leq -0.48:\\ \;\;\;\;\mathsf{fma}\left(im, im \cdot -0.5, 1\right) \cdot \left(re + 1\right)\\ \mathbf{elif}\;e^{re} \cdot \cos im \leq 0:\\ \;\;\;\;im \cdot \left(im \cdot -0.5\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: 47.6% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

function code(re, im)
	t_0 = Float64(exp(re) * cos(im))
	tmp = 0.0
	if (t_0 <= 0.0)
		tmp = Float64(im * Float64(im * -0.5));
	elseif (t_0 <= 2.0)
		tmp = Float64(re + 1.0);
	else
		tmp = fma(re, Float64(re * 0.5), 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, 0.0], N[(im * N[(im * -0.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2.0], N[(re + 1.0), $MachinePrecision], N[(re * N[(re * 0.5), $MachinePrecision] + re), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-cos.f64 33.4

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

   5. Applied rewrites 33.4%

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

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

   9. Taylor expanded in im around inf

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

   11. Applied rewrites 26.9%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lower-exp.f64 77.6

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

   5. Applied rewrites 77.6%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 77.6%

      \[\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 + re \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot re\right)\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 66.8%

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

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 66.8%

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

   12. Taylor expanded in re around 0

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

   14. Applied rewrites 62.3%

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

Alternative 14: 50.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{re} \cdot \cos im \leq 0:\\ \;\;\;\;im \cdot \left(im \cdot -0.5\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)) 0.0)
   (* im (* im -0.5))
   (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)) <= 0.0) {
		tmp = im * (im * -0.5);
	} 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)) <= 0.0)
		tmp = Float64(im * Float64(im * -0.5));
	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], 0.0], N[(im * N[(im * -0.5), $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)) < 0.0

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-cos.f64 33.4

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

   5. Applied rewrites 33.4%

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

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

   9. Taylor expanded in im around inf

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

   11. Applied rewrites 26.9%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lower-exp.f64 85.6

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

   5. Applied rewrites 85.6%

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

      \[\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 15: 50.0% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-cos.f64 33.4

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

   5. Applied rewrites 33.4%

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

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

   9. Taylor expanded in im around inf

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

   11. Applied rewrites 26.9%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lower-exp.f64 85.6

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

   5. Applied rewrites 85.6%

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

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

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 73.7%

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

Alternative 16: 47.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{re} \cdot \cos im \leq 0:\\ \;\;\;\;im \cdot \left(im \cdot -0.5\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)) 0.0)
   (* im (* im -0.5))
   (fma re (fma re 0.5 1.0) 1.0)))

C

double code(double re, double im) {
	double tmp;
	if ((exp(re) * cos(im)) <= 0.0) {
		tmp = im * (im * -0.5);
	} 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)) <= 0.0)
		tmp = Float64(im * Float64(im * -0.5));
	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], 0.0], N[(im * N[(im * -0.5), $MachinePrecision]), $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)) < 0.0

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-cos.f64 33.4

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

   5. Applied rewrites 33.4%

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

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

   9. Taylor expanded in im around inf

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

   11. Applied rewrites 26.9%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lower-exp.f64 85.6

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

   5. Applied rewrites 85.6%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 72.2%

      \[\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 17: 38.6% accurate, 0.9× speedup

Math

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

FPCore

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

C

double code(double re, double im) {
	double tmp;
	if ((exp(re) * cos(im)) <= 0.0) {
		tmp = im * (im * -0.5);
	} else {
		tmp = re + 1.0;
	}
	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)) <= 0.0d0) then
        tmp = im * (im * (-0.5d0))
    else
        tmp = re + 1.0d0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-cos.f64 33.4

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

   5. Applied rewrites 33.4%

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

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

   9. Taylor expanded in im around inf

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

   11. Applied rewrites 26.9%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. lower-exp.f64 85.6

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

   5. Applied rewrites 85.6%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 52.2%

      \[\leadsto re + \color{blue}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 18: 28.9% 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 70.4

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

5. Applied rewrites 70.4%

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

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

Alternative 19: 28.4% 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 70.4

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

5. Applied rewrites 70.4%

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

6. Taylor expanded in re around 0

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

8. Applied rewrites 28.0%

   \[\leadsto 1 \]
9. Add Preprocessing

Reproduce

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