math.exp on complex, real part

Percentage Accurate: 100.0% → 100.0%

Time: 7.4s

Alternatives: 13

Speedup: 1.0×

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

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (exp.f64 re) < 0.999998000000000054 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 86.2%

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

   if 0.999998000000000054 < (exp.f64 re) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0 100.0%

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

      1. distribute-rgt1-in 100.0%

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

   5. Simplified 100.0%

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

4. Final simplification 93.3%

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

Alternative 3: 92.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{re} \leq 0.999998 \lor \neg \left(e^{re} \leq 2\right):\\ \;\;\;\;e^{re}\\ \mathbf{else}:\\ \;\;\;\;\cos im\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (or (<= (exp re) 0.999998) (not (<= (exp re) 2.0))) (exp re) (cos im)))

C

double code(double re, double im) {
	double tmp;
	if ((exp(re) <= 0.999998) || !(exp(re) <= 2.0)) {
		tmp = exp(re);
	} else {
		tmp = cos(im);
	}
	return tmp;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if ((exp(re) <= 0.999998d0) .or. (.not. (exp(re) <= 2.0d0))) then
        tmp = exp(re)
    else
        tmp = cos(im)
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if ((Math.exp(re) <= 0.999998) || !(Math.exp(re) <= 2.0)) {
		tmp = Math.exp(re);
	} else {
		tmp = Math.cos(im);
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if (math.exp(re) <= 0.999998) or not (math.exp(re) <= 2.0):
		tmp = math.exp(re)
	else:
		tmp = math.cos(im)
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if ((exp(re) <= 0.999998) || !(exp(re) <= 2.0))
		tmp = exp(re);
	else
		tmp = cos(im);
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if ((exp(re) <= 0.999998) || ~((exp(re) <= 2.0)))
		tmp = exp(re);
	else
		tmp = cos(im);
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[Or[LessEqual[N[Exp[re], $MachinePrecision], 0.999998], N[Not[LessEqual[N[Exp[re], $MachinePrecision], 2.0]], $MachinePrecision]], N[Exp[re], $MachinePrecision], N[Cos[im], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (exp.f64 re) < 0.999998000000000054 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 86.2%

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

   if 0.999998000000000054 < (exp.f64 re) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0 99.7%

      \[\leadsto \color{blue}{\cos im} \]
3. Recombined 2 regimes into one program.

4. Final simplification 93.2%

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

Alternative 4: 97.5% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -2.7 \cdot 10^{-6}:\\ \;\;\;\;e^{re}\\ \mathbf{elif}\;re \leq 0.00025:\\ \;\;\;\;\cos im \cdot \left(-1 + \left(re + 2\right)\right)\\ \mathbf{elif}\;re \leq 3.4 \cdot 10^{+74}:\\ \;\;\;\;e^{re}\\ \mathbf{else}:\\ \;\;\;\;\cos im \cdot \left(1 + re \cdot \left(1 + re \cdot \left(0.5 + re \cdot \left(0.16666666666666666 + re \cdot 0.041666666666666664\right)\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -2.7e-6)
   (exp re)
   (if (<= re 0.00025)
     (* (cos im) (+ -1.0 (+ re 2.0)))
     (if (<= re 3.4e+74)
       (exp re)
       (*
        (cos im)
        (+
         1.0
         (*
          re
          (+
           1.0
           (*
            re
            (+
             0.5
             (*
              re
              (+ 0.16666666666666666 (* re 0.041666666666666664)))))))))))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -2.7e-6) {
		tmp = exp(re);
	} else if (re <= 0.00025) {
		tmp = cos(im) * (-1.0 + (re + 2.0));
	} else if (re <= 3.4e+74) {
		tmp = exp(re);
	} else {
		tmp = cos(im) * (1.0 + (re * (1.0 + (re * (0.5 + (re * (0.16666666666666666 + (re * 0.041666666666666664))))))));
	}
	return tmp;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if (re <= (-2.7d-6)) then
        tmp = exp(re)
    else if (re <= 0.00025d0) then
        tmp = cos(im) * ((-1.0d0) + (re + 2.0d0))
    else if (re <= 3.4d+74) then
        tmp = exp(re)
    else
        tmp = cos(im) * (1.0d0 + (re * (1.0d0 + (re * (0.5d0 + (re * (0.16666666666666666d0 + (re * 0.041666666666666664d0))))))))
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (re <= -2.7e-6) {
		tmp = Math.exp(re);
	} else if (re <= 0.00025) {
		tmp = Math.cos(im) * (-1.0 + (re + 2.0));
	} else if (re <= 3.4e+74) {
		tmp = Math.exp(re);
	} else {
		tmp = Math.cos(im) * (1.0 + (re * (1.0 + (re * (0.5 + (re * (0.16666666666666666 + (re * 0.041666666666666664))))))));
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if re <= -2.7e-6:
		tmp = math.exp(re)
	elif re <= 0.00025:
		tmp = math.cos(im) * (-1.0 + (re + 2.0))
	elif re <= 3.4e+74:
		tmp = math.exp(re)
	else:
		tmp = math.cos(im) * (1.0 + (re * (1.0 + (re * (0.5 + (re * (0.16666666666666666 + (re * 0.041666666666666664))))))))
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -2.7e-6)
		tmp = exp(re);
	elseif (re <= 0.00025)
		tmp = Float64(cos(im) * Float64(-1.0 + Float64(re + 2.0)));
	elseif (re <= 3.4e+74)
		tmp = exp(re);
	else
		tmp = Float64(cos(im) * Float64(1.0 + Float64(re * Float64(1.0 + Float64(re * Float64(0.5 + Float64(re * Float64(0.16666666666666666 + Float64(re * 0.041666666666666664)))))))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (re <= -2.7e-6)
		tmp = exp(re);
	elseif (re <= 0.00025)
		tmp = cos(im) * (-1.0 + (re + 2.0));
	elseif (re <= 3.4e+74)
		tmp = exp(re);
	else
		tmp = cos(im) * (1.0 + (re * (1.0 + (re * (0.5 + (re * (0.16666666666666666 + (re * 0.041666666666666664))))))));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[re, -2.7e-6], N[Exp[re], $MachinePrecision], If[LessEqual[re, 0.00025], N[(N[Cos[im], $MachinePrecision] * N[(-1.0 + N[(re + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 3.4e+74], N[Exp[re], $MachinePrecision], N[(N[Cos[im], $MachinePrecision] * N[(1.0 + N[(re * N[(1.0 + N[(re * N[(0.5 + N[(re * N[(0.16666666666666666 + N[(re * 0.041666666666666664), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if re < -2.69999999999999998e-6 or 2.5000000000000001e-4 < re < 3.3999999999999999e74

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0 97.3%

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

   if -2.69999999999999998e-6 < re < 2.5000000000000001e-4

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0 100.0%

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

      1. distribute-rgt1-in 100.0%

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

   5. Simplified 100.0%

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

      1. expm1-log1p-u 100.0%

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

      2. expm1-undefine 100.0%

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

      3. +-commutative 100.0%

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

   7. Applied egg-rr 100.0%

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

      1. sub-neg 100.0%

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

      2. metadata-eval 100.0%

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

      3. +-commutative 100.0%

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

      4. log1p-undefine 100.0%

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

      5. rem-exp-log 100.0%

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

      6. associate-+r+ 100.0%

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

      7. metadata-eval 100.0%

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

   9. Simplified 100.0%

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

   if 3.3999999999999999e74 < re

   1. Initial program 100.0%

      \[e^{re} \cdot \cos im \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. log1p-expm1-u 100.0%

         \[\leadsto e^{\color{blue}{\mathsf{log1p}\left(\mathsf{expm1}\left(re\right)\right)}} \cdot \cos im \]

      2. log1p-undefine 100.0%

         \[\leadsto e^{\color{blue}{\log \left(1 + \mathsf{expm1}\left(re\right)\right)}} \cdot \cos im \]

      3. add-exp-log 100.0%

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

   4. Applied egg-rr 100.0%

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

   5. Taylor expanded in re around 0 98.1%

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

      1. *-commutative 98.1%

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

   7. Simplified 98.1%

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

4. Final simplification 98.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;re \leq -2.7 \cdot 10^{-6}:\\ \;\;\;\;e^{re}\\ \mathbf{elif}\;re \leq 0.00025:\\ \;\;\;\;\cos im \cdot \left(-1 + \left(re + 2\right)\right)\\ \mathbf{elif}\;re \leq 3.4 \cdot 10^{+74}:\\ \;\;\;\;e^{re}\\ \mathbf{else}:\\ \;\;\;\;\cos im \cdot \left(1 + re \cdot \left(1 + re \cdot \left(0.5 + re \cdot \left(0.16666666666666666 + re \cdot 0.041666666666666664\right)\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 97.2% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -2.7 \cdot 10^{-6}:\\ \;\;\;\;e^{re}\\ \mathbf{elif}\;re \leq 0.00088:\\ \;\;\;\;\cos im \cdot \left(-1 + \left(re + 2\right)\right)\\ \mathbf{elif}\;re \leq 1.02 \cdot 10^{+103}:\\ \;\;\;\;e^{re}\\ \mathbf{else}:\\ \;\;\;\;\cos im \cdot \left(1 + re \cdot \left(1 + re \cdot \left(0.5 + re \cdot 0.16666666666666666\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -2.7e-6)
   (exp re)
   (if (<= re 0.00088)
     (* (cos im) (+ -1.0 (+ re 2.0)))
     (if (<= re 1.02e+103)
       (exp re)
       (*
        (cos im)
        (+ 1.0 (* re (+ 1.0 (* re (+ 0.5 (* re 0.16666666666666666)))))))))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -2.7e-6) {
		tmp = exp(re);
	} else if (re <= 0.00088) {
		tmp = cos(im) * (-1.0 + (re + 2.0));
	} else if (re <= 1.02e+103) {
		tmp = exp(re);
	} else {
		tmp = cos(im) * (1.0 + (re * (1.0 + (re * (0.5 + (re * 0.16666666666666666))))));
	}
	return tmp;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if (re <= (-2.7d-6)) then
        tmp = exp(re)
    else if (re <= 0.00088d0) then
        tmp = cos(im) * ((-1.0d0) + (re + 2.0d0))
    else if (re <= 1.02d+103) then
        tmp = exp(re)
    else
        tmp = cos(im) * (1.0d0 + (re * (1.0d0 + (re * (0.5d0 + (re * 0.16666666666666666d0))))))
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (re <= -2.7e-6) {
		tmp = Math.exp(re);
	} else if (re <= 0.00088) {
		tmp = Math.cos(im) * (-1.0 + (re + 2.0));
	} else if (re <= 1.02e+103) {
		tmp = Math.exp(re);
	} else {
		tmp = Math.cos(im) * (1.0 + (re * (1.0 + (re * (0.5 + (re * 0.16666666666666666))))));
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if re <= -2.7e-6:
		tmp = math.exp(re)
	elif re <= 0.00088:
		tmp = math.cos(im) * (-1.0 + (re + 2.0))
	elif re <= 1.02e+103:
		tmp = math.exp(re)
	else:
		tmp = math.cos(im) * (1.0 + (re * (1.0 + (re * (0.5 + (re * 0.16666666666666666))))))
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -2.7e-6)
		tmp = exp(re);
	elseif (re <= 0.00088)
		tmp = Float64(cos(im) * Float64(-1.0 + Float64(re + 2.0)));
	elseif (re <= 1.02e+103)
		tmp = exp(re);
	else
		tmp = Float64(cos(im) * Float64(1.0 + Float64(re * Float64(1.0 + Float64(re * Float64(0.5 + Float64(re * 0.16666666666666666)))))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (re <= -2.7e-6)
		tmp = exp(re);
	elseif (re <= 0.00088)
		tmp = cos(im) * (-1.0 + (re + 2.0));
	elseif (re <= 1.02e+103)
		tmp = exp(re);
	else
		tmp = cos(im) * (1.0 + (re * (1.0 + (re * (0.5 + (re * 0.16666666666666666))))));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[re, -2.7e-6], N[Exp[re], $MachinePrecision], If[LessEqual[re, 0.00088], N[(N[Cos[im], $MachinePrecision] * N[(-1.0 + N[(re + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 1.02e+103], N[Exp[re], $MachinePrecision], N[(N[Cos[im], $MachinePrecision] * N[(1.0 + N[(re * N[(1.0 + N[(re * N[(0.5 + N[(re * 0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if re < -2.69999999999999998e-6 or 8.80000000000000031e-4 < re < 1.01999999999999991e103

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0 91.8%

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

   if -2.69999999999999998e-6 < re < 8.80000000000000031e-4

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0 100.0%

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

      1. distribute-rgt1-in 100.0%

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

   5. Simplified 100.0%

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

      1. expm1-log1p-u 100.0%

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

      2. expm1-undefine 100.0%

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

      3. +-commutative 100.0%

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

   7. Applied egg-rr 100.0%

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

      1. sub-neg 100.0%

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

      2. metadata-eval 100.0%

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

      3. +-commutative 100.0%

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

      4. log1p-undefine 100.0%

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

      5. rem-exp-log 100.0%

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

      6. associate-+r+ 100.0%

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

      7. metadata-eval 100.0%

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

   9. Simplified 100.0%

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

   if 1.01999999999999991e103 < re

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0 100.0%

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

      1. *-commutative 100.0%

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

   5. Simplified 100.0%

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

4. Final simplification 97.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;re \leq -2.7 \cdot 10^{-6}:\\ \;\;\;\;e^{re}\\ \mathbf{elif}\;re \leq 0.00088:\\ \;\;\;\;\cos im \cdot \left(-1 + \left(re + 2\right)\right)\\ \mathbf{elif}\;re \leq 1.02 \cdot 10^{+103}:\\ \;\;\;\;e^{re}\\ \mathbf{else}:\\ \;\;\;\;\cos im \cdot \left(1 + re \cdot \left(1 + re \cdot \left(0.5 + re \cdot 0.16666666666666666\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 96.2% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -2.7 \cdot 10^{-6}:\\ \;\;\;\;e^{re}\\ \mathbf{elif}\;re \leq 0.00128:\\ \;\;\;\;\cos im \cdot \left(-1 + \left(re + 2\right)\right)\\ \mathbf{elif}\;re \leq 1.9 \cdot 10^{+154}:\\ \;\;\;\;e^{re}\\ \mathbf{else}:\\ \;\;\;\;\cos im \cdot \left(1 + re \cdot \left(1 + re \cdot 0.5\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -2.7e-6)
   (exp re)
   (if (<= re 0.00128)
     (* (cos im) (+ -1.0 (+ re 2.0)))
     (if (<= re 1.9e+154)
       (exp re)
       (* (cos im) (+ 1.0 (* re (+ 1.0 (* re 0.5)))))))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -2.7e-6) {
		tmp = exp(re);
	} else if (re <= 0.00128) {
		tmp = cos(im) * (-1.0 + (re + 2.0));
	} else if (re <= 1.9e+154) {
		tmp = exp(re);
	} else {
		tmp = cos(im) * (1.0 + (re * (1.0 + (re * 0.5))));
	}
	return tmp;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if (re <= (-2.7d-6)) then
        tmp = exp(re)
    else if (re <= 0.00128d0) then
        tmp = cos(im) * ((-1.0d0) + (re + 2.0d0))
    else if (re <= 1.9d+154) then
        tmp = exp(re)
    else
        tmp = cos(im) * (1.0d0 + (re * (1.0d0 + (re * 0.5d0))))
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (re <= -2.7e-6) {
		tmp = Math.exp(re);
	} else if (re <= 0.00128) {
		tmp = Math.cos(im) * (-1.0 + (re + 2.0));
	} else if (re <= 1.9e+154) {
		tmp = Math.exp(re);
	} else {
		tmp = Math.cos(im) * (1.0 + (re * (1.0 + (re * 0.5))));
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if re <= -2.7e-6:
		tmp = math.exp(re)
	elif re <= 0.00128:
		tmp = math.cos(im) * (-1.0 + (re + 2.0))
	elif re <= 1.9e+154:
		tmp = math.exp(re)
	else:
		tmp = math.cos(im) * (1.0 + (re * (1.0 + (re * 0.5))))
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -2.7e-6)
		tmp = exp(re);
	elseif (re <= 0.00128)
		tmp = Float64(cos(im) * Float64(-1.0 + Float64(re + 2.0)));
	elseif (re <= 1.9e+154)
		tmp = exp(re);
	else
		tmp = Float64(cos(im) * Float64(1.0 + Float64(re * Float64(1.0 + Float64(re * 0.5)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (re <= -2.7e-6)
		tmp = exp(re);
	elseif (re <= 0.00128)
		tmp = cos(im) * (-1.0 + (re + 2.0));
	elseif (re <= 1.9e+154)
		tmp = exp(re);
	else
		tmp = cos(im) * (1.0 + (re * (1.0 + (re * 0.5))));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[re, -2.7e-6], N[Exp[re], $MachinePrecision], If[LessEqual[re, 0.00128], N[(N[Cos[im], $MachinePrecision] * N[(-1.0 + N[(re + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 1.9e+154], N[Exp[re], $MachinePrecision], N[(N[Cos[im], $MachinePrecision] * N[(1.0 + N[(re * N[(1.0 + N[(re * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if re < -2.69999999999999998e-6 or 0.0012800000000000001 < re < 1.8999999999999999e154

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0 90.4%

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

   if -2.69999999999999998e-6 < re < 0.0012800000000000001

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0 100.0%

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

      1. distribute-rgt1-in 100.0%

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

   5. Simplified 100.0%

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

      1. expm1-log1p-u 100.0%

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

      2. expm1-undefine 100.0%

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

      3. +-commutative 100.0%

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

   7. Applied egg-rr 100.0%

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

      1. sub-neg 100.0%

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

      2. metadata-eval 100.0%

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

      3. +-commutative 100.0%

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

      4. log1p-undefine 100.0%

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

      5. rem-exp-log 100.0%

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

      6. associate-+r+ 100.0%

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

      7. metadata-eval 100.0%

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

   9. Simplified 100.0%

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

   if 1.8999999999999999e154 < re

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0 100.0%

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

      1. *-commutative 100.0%

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

   5. Simplified 100.0%

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

4. Final simplification 96.5%

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

Alternative 7: 93.0% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -2.7 \cdot 10^{-6} \lor \neg \left(re \leq 0.0145\right):\\ \;\;\;\;e^{re}\\ \mathbf{else}:\\ \;\;\;\;\cos im \cdot \left(-1 + \left(re + 2\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (or (<= re -2.7e-6) (not (<= re 0.0145)))
   (exp re)
   (* (cos im) (+ -1.0 (+ re 2.0)))))

C

double code(double re, double im) {
	double tmp;
	if ((re <= -2.7e-6) || !(re <= 0.0145)) {
		tmp = exp(re);
	} else {
		tmp = cos(im) * (-1.0 + (re + 2.0));
	}
	return tmp;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if ((re <= (-2.7d-6)) .or. (.not. (re <= 0.0145d0))) then
        tmp = exp(re)
    else
        tmp = cos(im) * ((-1.0d0) + (re + 2.0d0))
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if ((re <= -2.7e-6) || !(re <= 0.0145)) {
		tmp = Math.exp(re);
	} else {
		tmp = Math.cos(im) * (-1.0 + (re + 2.0));
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if (re <= -2.7e-6) or not (re <= 0.0145):
		tmp = math.exp(re)
	else:
		tmp = math.cos(im) * (-1.0 + (re + 2.0))
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if ((re <= -2.7e-6) || !(re <= 0.0145))
		tmp = exp(re);
	else
		tmp = Float64(cos(im) * Float64(-1.0 + Float64(re + 2.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if ((re <= -2.7e-6) || ~((re <= 0.0145)))
		tmp = exp(re);
	else
		tmp = cos(im) * (-1.0 + (re + 2.0));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if re < -2.69999999999999998e-6 or 0.0145000000000000007 < re

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0 86.2%

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

   if -2.69999999999999998e-6 < re < 0.0145000000000000007

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0 100.0%

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

      1. distribute-rgt1-in 100.0%

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

   5. Simplified 100.0%

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

      1. expm1-log1p-u 100.0%

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

      2. expm1-undefine 100.0%

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

      3. +-commutative 100.0%

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

   7. Applied egg-rr 100.0%

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

      1. sub-neg 100.0%

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

      2. metadata-eval 100.0%

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

      3. +-commutative 100.0%

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

      4. log1p-undefine 100.0%

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

      5. rem-exp-log 100.0%

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

      6. associate-+r+ 100.0%

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

      7. metadata-eval 100.0%

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

   9. Simplified 100.0%

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

4. Final simplification 93.3%

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

Alternative 8: 63.4% accurate, 1.9× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re 2.35e-9)
   (cos im)
   (+ 1.0 (* re (+ 1.0 (* re (+ 0.5 (* re 0.16666666666666666))))))))

C

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

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if (re <= 2.35d-9) then
        tmp = cos(im)
    else
        tmp = 1.0d0 + (re * (1.0d0 + (re * (0.5d0 + (re * 0.16666666666666666d0)))))
    end if
    code = tmp
end function

Java

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

Python

def code(re, im):
	tmp = 0
	if re <= 2.35e-9:
		tmp = math.cos(im)
	else:
		tmp = 1.0 + (re * (1.0 + (re * (0.5 + (re * 0.16666666666666666)))))
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if re < 2.34999999999999995e-9

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0 68.6%

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

   if 2.34999999999999995e-9 < re

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0 71.9%

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

   4. Taylor expanded in re around 0 48.4%

      \[\leadsto \color{blue}{1 + re \cdot \left(1 + re \cdot \left(0.5 + 0.16666666666666666 \cdot re\right)\right)} \]
   5. Step-by-step derivation

      1. *-commutative 65.7%

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

   6. Simplified 48.4%

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

Alternative 9: 41.4% accurate, 15.6× speedup

Math

\[\begin{array}{l} \\ 1 + re \cdot \left(1 + re \cdot \left(0.5 + re \cdot 0.16666666666666666\right)\right) \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (+ 1.0 (* re (+ 1.0 (* re (+ 0.5 (* re 0.16666666666666666)))))))

C

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

Fortran

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

Java

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

Python

def code(re, im):
	return 1.0 + (re * (1.0 + (re * (0.5 + (re * 0.16666666666666666)))))

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in im around 0 72.4%

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

4. Taylor expanded in re around 0 43.1%

   \[\leadsto \color{blue}{1 + re \cdot \left(1 + re \cdot \left(0.5 + 0.16666666666666666 \cdot re\right)\right)} \]
5. Step-by-step derivation

   1. *-commutative 68.1%

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

6. Simplified 43.1%

   \[\leadsto \color{blue}{1 + re \cdot \left(1 + re \cdot \left(0.5 + re \cdot 0.16666666666666666\right)\right)} \]
7. Add Preprocessing

Alternative 10: 31.0% accurate, 16.9× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re 5.7e+51) 1.0 (+ 1.0 (* -0.5 (* im im)))))

C

double code(double re, double im) {
	double tmp;
	if (re <= 5.7e+51) {
		tmp = 1.0;
	} else {
		tmp = 1.0 + (-0.5 * (im * im));
	}
	return tmp;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if (re <= 5.7d+51) then
        tmp = 1.0d0
    else
        tmp = 1.0d0 + ((-0.5d0) * (im * im))
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (re <= 5.7e+51) {
		tmp = 1.0;
	} else {
		tmp = 1.0 + (-0.5 * (im * im));
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if re <= 5.7e+51:
		tmp = 1.0
	else:
		tmp = 1.0 + (-0.5 * (im * im))
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if re < 5.7000000000000002e51

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0 73.0%

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

   4. Taylor expanded in re around 0 39.6%

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

   if 5.7000000000000002e51 < re

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0 3.1%

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

   4. Taylor expanded in im around 0 20.2%

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

      1. unpow2 20.2%

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

   6. Applied egg-rr 20.2%

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

Alternative 11: 38.0% accurate, 22.6× speedup

Math

\[\begin{array}{l} \\ 1 + re \cdot \left(1 + re \cdot 0.5\right) \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in im around 0 72.4%

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

4. Taylor expanded in re around 0 40.9%

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

   1. *-commutative 65.1%

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

6. Simplified 40.9%

   \[\leadsto \color{blue}{1 + re \cdot \left(1 + re \cdot 0.5\right)} \]
7. Add Preprocessing

Alternative 12: 28.9% accurate, 67.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in im around 0 72.4%

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

4. Taylor expanded in re around 0 32.7%

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

   1. +-commutative 32.7%

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

6. Simplified 32.7%

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

Alternative 13: 28.5% accurate, 203.0× speedup

Math

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

FPCore

(FPCore (re im) :precision binary64 1.0)

C

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

Fortran

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

Java

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

Python

def code(re, im):
	return 1.0

Julia

function code(re, im)
	return 1.0
end

MATLAB

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

Wolfram

code[re_, im_] := 1.0

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in im around 0 72.4%

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

4. Taylor expanded in re around 0 32.4%

   \[\leadsto \color{blue}{1} \]
5. Add Preprocessing

Reproduce

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