math.exp on complex, real part

Percentage Accurate: 100.0% → 100.0%

Time: 6.3s

Alternatives: 10

Speedup: 1.0×

• 24.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: 92.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{re} \leq 5 \cdot 10^{-206} \lor \neg \left(e^{re} \leq 1.02\right):\\ \;\;\;\;e^{re}\\ \mathbf{else}:\\ \;\;\;\;\cos im\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (or (<= (exp re) 5e-206) (not (<= (exp re) 1.02))) (exp re) (cos im)))

C

double code(double re, double im) {
	double tmp;
	if ((exp(re) <= 5e-206) || !(exp(re) <= 1.02)) {
		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) <= 5d-206) .or. (.not. (exp(re) <= 1.02d0))) 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) <= 5e-206) || !(Math.exp(re) <= 1.02)) {
		tmp = Math.exp(re);
	} else {
		tmp = Math.cos(im);
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if (math.exp(re) <= 5e-206) or not (math.exp(re) <= 1.02):
		tmp = math.exp(re)
	else:
		tmp = math.cos(im)
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if ((exp(re) <= 5e-206) || !(exp(re) <= 1.02))
		tmp = exp(re);
	else
		tmp = cos(im);
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if ((exp(re) <= 5e-206) || ~((exp(re) <= 1.02)))
		tmp = exp(re);
	else
		tmp = cos(im);
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[Or[LessEqual[N[Exp[re], $MachinePrecision], 5e-206], N[Not[LessEqual[N[Exp[re], $MachinePrecision], 1.02]], $MachinePrecision]], N[Exp[re], $MachinePrecision], N[Cos[im], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (exp.f64 re) < 5e-206 or 1.02 < (exp.f64 re)

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0 91.1%

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

   if 5e-206 < (exp.f64 re) < 1.02

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0 97.2%

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

4. Final simplification 94.3%

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

Alternative 3: 97.5% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -0.055 \lor \neg \left(re \leq 0.011\right) \land re \leq 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 (or (<= re -0.055) (and (not (<= re 0.011)) (<= re 1e+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 <= -0.055) || (!(re <= 0.011) && (re <= 1e+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 <= (-0.055d0)) .or. (.not. (re <= 0.011d0)) .and. (re <= 1d+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 <= -0.055) || (!(re <= 0.011) && (re <= 1e+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 <= -0.055) or (not (re <= 0.011) and (re <= 1e+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 <= -0.055) || (!(re <= 0.011) && (re <= 1e+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 <= -0.055) || (~((re <= 0.011)) && (re <= 1e+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[Or[LessEqual[re, -0.055], And[N[Not[LessEqual[re, 0.011]], $MachinePrecision], LessEqual[re, 1e+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 2 regimes

2. if re < -0.0550000000000000003 or 0.010999999999999999 < re < 1e103

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0 96.6%

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

   if -0.0550000000000000003 < re < 0.010999999999999999 or 1e103 < 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 2 regimes into one program.

4. Final simplification 98.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;re \leq -0.055 \lor \neg \left(re \leq 0.011\right) \land re \leq 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 4: 96.2% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -21 \lor \neg \left(re \leq 0.013\right) \land 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 (or (<= re -21.0) (and (not (<= re 0.013)) (<= 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 <= -21.0) || (!(re <= 0.013) && (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 <= (-21.0d0)) .or. (.not. (re <= 0.013d0)) .and. (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 <= -21.0) || (!(re <= 0.013) && (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 <= -21.0) or (not (re <= 0.013) and (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 <= -21.0) || (!(re <= 0.013) && (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 <= -21.0) || (~((re <= 0.013)) && (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[Or[LessEqual[re, -21.0], And[N[Not[LessEqual[re, 0.013]], $MachinePrecision], 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 2 regimes

2. if re < -21 or 0.0129999999999999994 < re < 1.8999999999999999e154

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0 97.0%

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

   if -21 < re < 0.0129999999999999994 or 1.8999999999999999e154 < re

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0 99.3%

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

4. Final simplification 98.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;re \leq -21 \lor \neg \left(re \leq 0.013\right) \land 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 5: 93.2% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (or (<= re -0.00175) (not (<= re 0.00041)))
   (exp re)
   (* (cos im) (+ re 1.0))))

C

double code(double re, double im) {
	double tmp;
	if ((re <= -0.00175) || !(re <= 0.00041)) {
		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 ((re <= (-0.00175d0)) .or. (.not. (re <= 0.00041d0))) 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 ((re <= -0.00175) || !(re <= 0.00041)) {
		tmp = Math.exp(re);
	} else {
		tmp = Math.cos(im) * (re + 1.0);
	}
	return tmp;
}

Python

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

Julia

function code(re, im)
	tmp = 0.0
	if ((re <= -0.00175) || !(re <= 0.00041))
		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 ((re <= -0.00175) || ~((re <= 0.00041)))
		tmp = exp(re);
	else
		tmp = cos(im) * (re + 1.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[Or[LessEqual[re, -0.00175], N[Not[LessEqual[re, 0.00041]], $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 re < -0.00175000000000000004 or 4.0999999999999999e-4 < re

   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 -0.00175000000000000004 < re < 4.0999999999999999e-4

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0 99.5%

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

4. Final simplification 95.1%

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

Alternative 6: 61.7% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq 0.00016:\\ \;\;\;\;\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 0.00016)
   (cos im)
   (+ 1.0 (* re (+ 1.0 (* re (+ 0.5 (* re 0.16666666666666666))))))))

C

double code(double re, double im) {
	double tmp;
	if (re <= 0.00016) {
		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 <= 0.00016d0) 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 <= 0.00016) {
		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 <= 0.00016:
		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 <= 0.00016)
		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 <= 0.00016)
		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, 0.00016], 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 < 1.60000000000000013e-4

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0 64.3%

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

   if 1.60000000000000013e-4 < re

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0 79.2%

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

   4. Taylor expanded in re around 0 57.3%

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

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

      \[\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 7: 40.3% 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 68.5%

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

4. Taylor expanded in re around 0 36.8%

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

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

Alternative 8: 37.4% 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 68.5%

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

4. Taylor expanded in re around 0 32.4%

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

5. Final simplification 32.4%

   \[\leadsto 1 + re \cdot \left(1 + re \cdot 0.5\right) \]
6. Add Preprocessing

Alternative 9: 28.8% 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 re around 0 52.8%

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

4. Taylor expanded in im around 0 26.0%

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

   1. +-commutative 26.0%

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

6. Simplified 26.0%

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

Alternative 10: 28.4% 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 re around 0 51.7%

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

4. Taylor expanded in im around 0 25.5%

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

Reproduce

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