math.exp on complex, real part

Percentage Accurate: 100.0% → 100.0%

Time: 11.0s

Alternatives: 19

Speedup: 1.0×

• 23.7% 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: 86.7% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (or (<= (exp re) 0.99) (not (<= (exp re) 2.0)))
   (* (exp re) (fma (* im im) -0.5 1.0))
   (* (fma (fma 0.5 re 1.0) re 1.0) (cos im))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (exp.f64 re) < 0.98999999999999999 or 2 < (exp.f64 re)

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 85.0

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

   5. Applied rewrites 85.0%

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

   if 0.98999999999999999 < (exp.f64 re) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 99.7

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

   5. Applied rewrites 99.7%

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

4. Final simplification 92.5%

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

Alternative 3: 86.5% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (or (<= (exp re) 0.99) (not (<= (exp re) 2.0)))
   (* (exp re) (fma (* im im) -0.5 1.0))
   (* (+ 1.0 re) (cos im))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (exp.f64 re) < 0.98999999999999999 or 2 < (exp.f64 re)

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 85.0

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

   5. Applied rewrites 85.0%

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

   if 0.98999999999999999 < (exp.f64 re) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-+.f64 99.6

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

   5. Applied rewrites 99.6%

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

4. Final simplification 92.4%

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

Alternative 4: 40.6% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (exp re) (cos im)) 5e-179)
   (* (* im im) -0.5)
   (fma (fma 0.041666666666666664 (* im im) -0.5) (* im im) 1.0)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < 4.9999999999999998e-179

   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 31.9

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

   5. Applied rewrites 31.9%

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

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

       \[\leadsto \left(im \cdot im\right) \cdot -0.5 \]

   if 4.9999999999999998e-179 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-cos.f64 70.6

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

   5. Applied rewrites 70.6%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 49.4%

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

Alternative 5: 40.4% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (exp re) (cos im)) 5e-179)
   (* (* im im) -0.5)
   (fma (* 0.041666666666666664 (* im im)) (* im im) 1.0)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < 4.9999999999999998e-179

   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 31.9

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

   5. Applied rewrites 31.9%

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

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

       \[\leadsto \left(im \cdot im\right) \cdot -0.5 \]

   if 4.9999999999999998e-179 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-cos.f64 70.6

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

   5. Applied rewrites 70.6%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 49.4%

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

   9. Taylor expanded in im around inf

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

   11. Applied rewrites 49.3%

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

Alternative 6: 35.6% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < 4.9999999999999998e-179

   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 31.9

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

   5. Applied rewrites 31.9%

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

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

       \[\leadsto \left(im \cdot im\right) \cdot -0.5 \]

   if 4.9999999999999998e-179 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-cos.f64 70.6

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

   5. Applied rewrites 70.6%

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

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

Alternative 7: 90.4% accurate, 1.4× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (or (<= re -0.0135) (not (or (<= re 0.0305) (not (<= re 1.05e+103)))))
   (* (exp re) (fma (* im im) -0.5 1.0))
   (* (fma (fma (fma 0.16666666666666666 re 0.5) re 1.0) re 1.0) (cos im))))

C

double code(double re, double im) {
	double tmp;
	if ((re <= -0.0135) || !((re <= 0.0305) || !(re <= 1.05e+103))) {
		tmp = exp(re) * fma((im * im), -0.5, 1.0);
	} else {
		tmp = fma(fma(fma(0.16666666666666666, re, 0.5), re, 1.0), re, 1.0) * cos(im);
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if ((re <= -0.0135) || !((re <= 0.0305) || !(re <= 1.05e+103)))
		tmp = Float64(exp(re) * fma(Float64(im * im), -0.5, 1.0));
	else
		tmp = Float64(fma(fma(fma(0.16666666666666666, re, 0.5), re, 1.0), re, 1.0) * cos(im));
	end
	return tmp
end

Wolfram

code[re_, im_] := If[Or[LessEqual[re, -0.0135], N[Not[Or[LessEqual[re, 0.0305], N[Not[LessEqual[re, 1.05e+103]], $MachinePrecision]]], $MachinePrecision]], N[(N[Exp[re], $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(0.16666666666666666 * re + 0.5), $MachinePrecision] * re + 1.0), $MachinePrecision] * re + 1.0), $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if re < -0.0134999999999999998 or 0.030499999999999999 < re < 1.0500000000000001e103

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 83.6

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

   5. Applied rewrites 83.6%

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

   if -0.0134999999999999998 < re < 0.030499999999999999 or 1.0500000000000001e103 < re

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-fma.f64 99.9

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

   5. Applied rewrites 99.9%

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

4. Final simplification 94.5%

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

Alternative 8: 90.4% accurate, 1.5× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (exp re) (fma (* im im) -0.5 1.0))))
   (if (<= re -0.0135)
     t_0
     (if (<= re 0.0305)
       (* (+ re (fma (* re re) (fma 0.16666666666666666 re 0.5) 1.0)) (cos im))
       (if (<= re 1.05e+103)
         t_0
         (*
          (fma (fma (fma 0.16666666666666666 re 0.5) re 1.0) re 1.0)
          (cos im)))))))

C

double code(double re, double im) {
	double t_0 = exp(re) * fma((im * im), -0.5, 1.0);
	double tmp;
	if (re <= -0.0135) {
		tmp = t_0;
	} else if (re <= 0.0305) {
		tmp = (re + fma((re * re), fma(0.16666666666666666, re, 0.5), 1.0)) * cos(im);
	} else if (re <= 1.05e+103) {
		tmp = t_0;
	} else {
		tmp = fma(fma(fma(0.16666666666666666, re, 0.5), re, 1.0), re, 1.0) * cos(im);
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if re < -0.0134999999999999998 or 0.030499999999999999 < re < 1.0500000000000001e103

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 83.6

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

   5. Applied rewrites 83.6%

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

   if -0.0134999999999999998 < re < 0.030499999999999999

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-fma.f64 99.9

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

   5. Applied rewrites 99.9%

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

   7. Applied rewrites 99.9%

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

   if 1.0500000000000001e103 < re

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-fma.f64 100.0

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

   5. Applied rewrites 100.0%

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

Alternative 9: 45.9% accurate, 1.5× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (exp re) 5e-15)
   (* (* im im) -0.5)
   (*
    (fma (fma (fma 0.16666666666666666 re 0.5) re 1.0) re 1.0)
    (fma (* im im) -0.5 1.0))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (exp.f64 re) < 4.99999999999999999e-15

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-cos.f64 3.2

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

   5. Applied rewrites 3.2%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 2.6%

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

       \[\leadsto \left(im \cdot im\right) \cdot -0.5 \]

   if 4.99999999999999999e-15 < (exp.f64 re)

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-fma.f64 92.6

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

   5. Applied rewrites 92.6%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 53.3

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

   8. Applied rewrites 53.3%

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

Alternative 10: 45.5% accurate, 1.5× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (exp re) 5e-15)
   (* (* im im) -0.5)
   (*
    (fma (* (* re re) 0.16666666666666666) re 1.0)
    (fma (* im im) -0.5 1.0))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (exp.f64 re) < 4.99999999999999999e-15

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-cos.f64 3.2

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

   5. Applied rewrites 3.2%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 2.6%

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

       \[\leadsto \left(im \cdot im\right) \cdot -0.5 \]

   if 4.99999999999999999e-15 < (exp.f64 re)

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-fma.f64 92.6

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

   5. Applied rewrites 92.6%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 53.3

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

   8. Applied rewrites 53.3%

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

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 52.8%

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

Alternative 11: 43.8% accurate, 1.5× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (exp re) 5e-15)
   (* (* im im) -0.5)
   (* (fma (fma 0.5 re 1.0) re 1.0) (fma (* im im) -0.5 1.0))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (exp.f64 re) < 4.99999999999999999e-15

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-cos.f64 3.2

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

   5. Applied rewrites 3.2%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 2.6%

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

       \[\leadsto \left(im \cdot im\right) \cdot -0.5 \]

   if 4.99999999999999999e-15 < (exp.f64 re)

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 86.4

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

   5. Applied rewrites 86.4%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 48.7

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

   8. Applied rewrites 48.7%

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

Alternative 12: 86.7% accurate, 1.6× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (or (<= re -0.01) (not (<= re 0.0195)))
   (* (exp re) (fma (* im im) -0.5 1.0))
   (* (+ re (fma (* re re) 0.5 1.0)) (cos im))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if re < -0.0100000000000000002 or 0.0195 < re

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 85.0

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

   5. Applied rewrites 85.0%

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

   if -0.0100000000000000002 < re < 0.0195

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 99.7

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

   5. Applied rewrites 99.7%

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

   7. Applied rewrites 99.7%

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

4. Final simplification 92.5%

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

Alternative 13: 37.6% accurate, 1.6× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (exp re) 5e-15)
   (* (* im im) -0.5)
   (* (+ 1.0 re) (fma (* im im) -0.5 1.0))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (exp.f64 re) < 4.99999999999999999e-15

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-cos.f64 3.2

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

   5. Applied rewrites 3.2%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 2.6%

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

       \[\leadsto \left(im \cdot im\right) \cdot -0.5 \]

   if 4.99999999999999999e-15 < (exp.f64 re)

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-+.f64 71.5

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

   5. Applied rewrites 71.5%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 39.9

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

   8. Applied rewrites 39.9%

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

Alternative 14: 81.3% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if re < -1

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 81.5

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

   5. Applied rewrites 81.5%

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

   6. Taylor expanded in im around inf

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

   8. Applied rewrites 80.1%

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

   if -1 < re < 7.2000000000000005e33

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-+.f64 96.3

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

   5. Applied rewrites 96.3%

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

   if 7.2000000000000005e33 < re

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-fma.f64 81.6

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

   5. Applied rewrites 81.6%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 75.5

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

   8. Applied rewrites 75.5%

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

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 75.5%

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

Alternative 15: 73.9% accurate, 1.7× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -1.0)
   (* (pow im 6.0) -0.001388888888888889)
   (if (<= re 7.2e+33)
     (* (+ 1.0 re) (cos im))
     (*
      (fma (* (* re re) 0.16666666666666666) re 1.0)
      (fma (* im im) -0.5 1.0)))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -1.0) {
		tmp = pow(im, 6.0) * -0.001388888888888889;
	} else if (re <= 7.2e+33) {
		tmp = (1.0 + re) * cos(im);
	} else {
		tmp = fma(((re * re) * 0.16666666666666666), re, 1.0) * fma((im * im), -0.5, 1.0);
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -1.0)
		tmp = Float64((im ^ 6.0) * -0.001388888888888889);
	elseif (re <= 7.2e+33)
		tmp = Float64(Float64(1.0 + re) * cos(im));
	else
		tmp = Float64(fma(Float64(Float64(re * re) * 0.16666666666666666), re, 1.0) * fma(Float64(im * im), -0.5, 1.0));
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[re, -1.0], N[(N[Power[im, 6.0], $MachinePrecision] * -0.001388888888888889), $MachinePrecision], If[LessEqual[re, 7.2e+33], N[(N[(1.0 + re), $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(re * re), $MachinePrecision] * 0.16666666666666666), $MachinePrecision] * re + 1.0), $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if re < -1

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-cos.f64 3.2

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

   5. Applied rewrites 3.2%

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

   6. Taylor expanded in im around 0

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

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

   9. Taylor expanded in im around inf

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

   11. Applied rewrites 42.9%

       \[\leadsto {im}^{6} \cdot -0.001388888888888889 \]

   if -1 < re < 7.2000000000000005e33

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-+.f64 96.3

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

   5. Applied rewrites 96.3%

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

   if 7.2000000000000005e33 < re

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-fma.f64 81.6

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

   5. Applied rewrites 81.6%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 75.5

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

   8. Applied rewrites 75.5%

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

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 75.5%

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

Alternative 16: 73.4% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -400.0)
   (* (pow im 6.0) -0.001388888888888889)
   (if (<= re 7.2e+33)
     (cos im)
     (*
      (fma (* (* re re) 0.16666666666666666) re 1.0)
      (fma (* im im) -0.5 1.0)))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -400.0) {
		tmp = pow(im, 6.0) * -0.001388888888888889;
	} else if (re <= 7.2e+33) {
		tmp = cos(im);
	} else {
		tmp = fma(((re * re) * 0.16666666666666666), re, 1.0) * fma((im * im), -0.5, 1.0);
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -400.0)
		tmp = Float64((im ^ 6.0) * -0.001388888888888889);
	elseif (re <= 7.2e+33)
		tmp = cos(im);
	else
		tmp = Float64(fma(Float64(Float64(re * re) * 0.16666666666666666), re, 1.0) * fma(Float64(im * im), -0.5, 1.0));
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[re, -400.0], N[(N[Power[im, 6.0], $MachinePrecision] * -0.001388888888888889), $MachinePrecision], If[LessEqual[re, 7.2e+33], N[Cos[im], $MachinePrecision], N[(N[(N[(N[(re * re), $MachinePrecision] * 0.16666666666666666), $MachinePrecision] * re + 1.0), $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if re < -400

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

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

   9. Taylor expanded in im around inf

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

   11. Applied rewrites 43.5%

       \[\leadsto {im}^{6} \cdot -0.001388888888888889 \]

   if -400 < re < 7.2000000000000005e33

   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 94.6

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

   5. Applied rewrites 94.6%

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

   if 7.2000000000000005e33 < re

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-fma.f64 81.6

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

   5. Applied rewrites 81.6%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 75.5

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

   8. Applied rewrites 75.5%

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

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 75.5%

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

Alternative 17: 72.4% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -400.0)
   (* (pow im 4.0) 0.041666666666666664)
   (if (<= re 7.2e+33)
     (cos im)
     (*
      (fma (* (* re re) 0.16666666666666666) re 1.0)
      (fma (* im im) -0.5 1.0)))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -400.0) {
		tmp = pow(im, 4.0) * 0.041666666666666664;
	} else if (re <= 7.2e+33) {
		tmp = cos(im);
	} else {
		tmp = fma(((re * re) * 0.16666666666666666), re, 1.0) * fma((im * im), -0.5, 1.0);
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -400.0)
		tmp = Float64((im ^ 4.0) * 0.041666666666666664);
	elseif (re <= 7.2e+33)
		tmp = cos(im);
	else
		tmp = Float64(fma(Float64(Float64(re * re) * 0.16666666666666666), re, 1.0) * fma(Float64(im * im), -0.5, 1.0));
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[re, -400.0], N[(N[Power[im, 4.0], $MachinePrecision] * 0.041666666666666664), $MachinePrecision], If[LessEqual[re, 7.2e+33], N[Cos[im], $MachinePrecision], N[(N[(N[(N[(re * re), $MachinePrecision] * 0.16666666666666666), $MachinePrecision] * re + 1.0), $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if re < -400

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. lower-cos.f64 3.1

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

   5. Applied rewrites 3.1%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 2.5%

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

   9. Taylor expanded in im around inf

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

   11. Applied rewrites 40.7%

       \[\leadsto {im}^{4} \cdot 0.041666666666666664 \]

   if -400 < re < 7.2000000000000005e33

   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 94.6

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

   5. Applied rewrites 94.6%

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

   if 7.2000000000000005e33 < re

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-fma.f64 81.6

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

   5. Applied rewrites 81.6%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 75.5

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

   8. Applied rewrites 75.5%

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

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 75.5%

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

Alternative 18: 69.1% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -400.0)
   (* (* im im) -0.5)
   (if (<= re 7.2e+33)
     (cos im)
     (*
      (fma (* (* re re) 0.16666666666666666) re 1.0)
      (fma (* im im) -0.5 1.0)))))

C

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

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -400.0)
		tmp = Float64(Float64(im * im) * -0.5);
	elseif (re <= 7.2e+33)
		tmp = cos(im);
	else
		tmp = Float64(fma(Float64(Float64(re * re) * 0.16666666666666666), re, 1.0) * fma(Float64(im * im), -0.5, 1.0));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if re < -400

   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}{\frac{-1}{2} \cdot {im}^{2}} \]
   7. Step-by-step derivation

   8. Applied rewrites 2.6%

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

       \[\leadsto \left(im \cdot im\right) \cdot -0.5 \]

   if -400 < re < 7.2000000000000005e33

   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 94.6

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

   5. Applied rewrites 94.6%

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

   if 7.2000000000000005e33 < re

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-fma.f64 81.6

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

   5. Applied rewrites 81.6%

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

   6. Taylor expanded in im around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 75.5

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

   8. Applied rewrites 75.5%

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

   9. Taylor expanded in re around inf

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

   11. Applied rewrites 75.5%

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

Alternative 19: 11.3% accurate, 18.7× speedup

Math

\[\begin{array}{l} \\ \left(im \cdot im\right) \cdot -0.5 \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (* (* im im) -0.5))

C

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

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = (im * im) * (-0.5d0)
end function

Java

public static double code(double re, double im) {
	return (im * im) * -0.5;
}

Python

def code(re, im):
	return (im * im) * -0.5

Julia

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

MATLAB

function tmp = code(re, im)
	tmp = (im * im) * -0.5;
end

Wolfram

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

Derivation

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 51.7

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

5. Applied rewrites 51.7%

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

6. Taylor expanded in im around 0

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

8. Applied rewrites 28.0%

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

    \[\leadsto \left(im \cdot im\right) \cdot -0.5 \]
12. Add Preprocessing

Reproduce

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