math.cos on complex, real part

Percentage Accurate: 100.0% → 100.0%

Time: 4.9s

Alternatives: 11

Speedup: 1.0×

• 50.0% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ \left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (* (* 0.5 (cos re)) (+ (exp (- im)) (exp im))))

C

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

Fortran

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

Java

public static double code(double re, double im) {
	return (0.5 * Math.cos(re)) * (Math.exp(-im) + Math.exp(im));
}

Python

def code(re, im):
	return (0.5 * math.cos(re)) * (math.exp(-im) + math.exp(im))

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (* (* 0.5 (cos re)) (+ (exp (- im)) (exp im))))

C

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

Fortran

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

Java

public static double code(double re, double im) {
	return (0.5 * Math.cos(re)) * (Math.exp(-im) + Math.exp(im));
}

Python

def code(re, im):
	return (0.5 * math.cos(re)) * (math.exp(-im) + math.exp(im))

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (* (* 0.5 (cos re)) (+ (exp (- im)) (exp im))))

C

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

Fortran

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

Java

public static double code(double re, double im) {
	return (0.5 * Math.cos(re)) * (Math.exp(-im) + Math.exp(im));
}

Python

def code(re, im):
	return (0.5 * math.cos(re)) * (math.exp(-im) + math.exp(im))

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
2. Add Preprocessing

3. Final simplification 100.0%

   \[\leadsto \left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
4. Add Preprocessing

Alternative 2: 71.7% accurate, 1.5× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= im 0.0085)
   (cos re)
   (if (<= im 1.35e+154)
     (* 0.5 (+ (exp (- im)) (exp im)))
     (* (cos re) (* 0.5 (pow im 2.0))))))

C

double code(double re, double im) {
	double tmp;
	if (im <= 0.0085) {
		tmp = cos(re);
	} else if (im <= 1.35e+154) {
		tmp = 0.5 * (exp(-im) + exp(im));
	} else {
		tmp = cos(re) * (0.5 * pow(im, 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 (im <= 0.0085d0) then
        tmp = cos(re)
    else if (im <= 1.35d+154) then
        tmp = 0.5d0 * (exp(-im) + exp(im))
    else
        tmp = cos(re) * (0.5d0 * (im ** 2.0d0))
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (im <= 0.0085) {
		tmp = Math.cos(re);
	} else if (im <= 1.35e+154) {
		tmp = 0.5 * (Math.exp(-im) + Math.exp(im));
	} else {
		tmp = Math.cos(re) * (0.5 * Math.pow(im, 2.0));
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if im <= 0.0085:
		tmp = math.cos(re)
	elif im <= 1.35e+154:
		tmp = 0.5 * (math.exp(-im) + math.exp(im))
	else:
		tmp = math.cos(re) * (0.5 * math.pow(im, 2.0))
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (im <= 0.0085)
		tmp = cos(re);
	elseif (im <= 1.35e+154)
		tmp = Float64(0.5 * Float64(exp(Float64(-im)) + exp(im)));
	else
		tmp = Float64(cos(re) * Float64(0.5 * (im ^ 2.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (im <= 0.0085)
		tmp = cos(re);
	elseif (im <= 1.35e+154)
		tmp = 0.5 * (exp(-im) + exp(im));
	else
		tmp = cos(re) * (0.5 * (im ^ 2.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[im, 0.0085], N[Cos[re], $MachinePrecision], If[LessEqual[im, 1.35e+154], N[(0.5 * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Cos[re], $MachinePrecision] * N[(0.5 * N[Power[im, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if im < 0.0085000000000000006

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0 66.9%

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

   if 0.0085000000000000006 < im < 1.35000000000000003e154

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0 70.5%

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

   if 1.35000000000000003e154 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
   2. Add Preprocessing

   4. Applied egg-rr 100.0%

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

   5. Taylor expanded in im around 0 100.0%

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

      1. associate-*r* 100.0%

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

      2. distribute-rgt1-in 100.0%

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

   7. Simplified 100.0%

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

   8. Taylor expanded in im around inf 100.0%

      \[\leadsto \color{blue}{0.5 \cdot \left({im}^{2} \cdot \cos re\right)} \]
   9. Step-by-step derivation

      1. associate-*r* 100.0%

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

      2. *-commutative 100.0%

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

   10. Simplified 100.0%

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

4. Final simplification 72.3%

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

Alternative 3: 84.5% accurate, 1.5× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= im 0.0095)
   (* (* 0.5 (cos re)) (+ 2.0 (pow im 2.0)))
   (if (<= im 1.35e+154)
     (* 0.5 (+ (exp (- im)) (exp im)))
     (* (cos re) (* 0.5 (pow im 2.0))))))

C

double code(double re, double im) {
	double tmp;
	if (im <= 0.0095) {
		tmp = (0.5 * cos(re)) * (2.0 + pow(im, 2.0));
	} else if (im <= 1.35e+154) {
		tmp = 0.5 * (exp(-im) + exp(im));
	} else {
		tmp = cos(re) * (0.5 * pow(im, 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 (im <= 0.0095d0) then
        tmp = (0.5d0 * cos(re)) * (2.0d0 + (im ** 2.0d0))
    else if (im <= 1.35d+154) then
        tmp = 0.5d0 * (exp(-im) + exp(im))
    else
        tmp = cos(re) * (0.5d0 * (im ** 2.0d0))
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (im <= 0.0095) {
		tmp = (0.5 * Math.cos(re)) * (2.0 + Math.pow(im, 2.0));
	} else if (im <= 1.35e+154) {
		tmp = 0.5 * (Math.exp(-im) + Math.exp(im));
	} else {
		tmp = Math.cos(re) * (0.5 * Math.pow(im, 2.0));
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if im <= 0.0095:
		tmp = (0.5 * math.cos(re)) * (2.0 + math.pow(im, 2.0))
	elif im <= 1.35e+154:
		tmp = 0.5 * (math.exp(-im) + math.exp(im))
	else:
		tmp = math.cos(re) * (0.5 * math.pow(im, 2.0))
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (im <= 0.0095)
		tmp = Float64(Float64(0.5 * cos(re)) * Float64(2.0 + (im ^ 2.0)));
	elseif (im <= 1.35e+154)
		tmp = Float64(0.5 * Float64(exp(Float64(-im)) + exp(im)));
	else
		tmp = Float64(cos(re) * Float64(0.5 * (im ^ 2.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (im <= 0.0095)
		tmp = (0.5 * cos(re)) * (2.0 + (im ^ 2.0));
	elseif (im <= 1.35e+154)
		tmp = 0.5 * (exp(-im) + exp(im));
	else
		tmp = cos(re) * (0.5 * (im ^ 2.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[im, 0.0095], N[(N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision] * N[(2.0 + N[Power[im, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[im, 1.35e+154], N[(0.5 * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Cos[re], $MachinePrecision] * N[(0.5 * N[Power[im, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if im < 0.00949999999999999976

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0 83.3%

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

   if 0.00949999999999999976 < im < 1.35000000000000003e154

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0 70.5%

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

   if 1.35000000000000003e154 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
   2. Add Preprocessing

   4. Applied egg-rr 100.0%

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

   5. Taylor expanded in im around 0 100.0%

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

      1. associate-*r* 100.0%

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

      2. distribute-rgt1-in 100.0%

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

   7. Simplified 100.0%

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

   8. Taylor expanded in im around inf 100.0%

      \[\leadsto \color{blue}{0.5 \cdot \left({im}^{2} \cdot \cos re\right)} \]
   9. Step-by-step derivation

      1. associate-*r* 100.0%

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

      2. *-commutative 100.0%

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

   10. Simplified 100.0%

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

4. Final simplification 84.1%

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

Alternative 4: 68.9% accurate, 1.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if im < 0.00899999999999999932

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0 66.9%

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

   if 0.00899999999999999932 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0 70.8%

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

4. Final simplification 68.0%

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

Alternative 5: 60.8% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;im \leq 4.1 \cdot 10^{+19}:\\ \;\;\;\;\cos re\\ \mathbf{elif}\;im \leq 1.05 \cdot 10^{+144}:\\ \;\;\;\;0.25 + 0.25 \cdot {re}^{2}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \mathsf{fma}\left(im, im, 2\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= im 4.1e+19)
   (cos re)
   (if (<= im 1.05e+144)
     (+ 0.25 (* 0.25 (pow re 2.0)))
     (* 0.5 (fma im im 2.0)))))

C

double code(double re, double im) {
	double tmp;
	if (im <= 4.1e+19) {
		tmp = cos(re);
	} else if (im <= 1.05e+144) {
		tmp = 0.25 + (0.25 * pow(re, 2.0));
	} else {
		tmp = 0.5 * fma(im, im, 2.0);
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (im <= 4.1e+19)
		tmp = cos(re);
	elseif (im <= 1.05e+144)
		tmp = Float64(0.25 + Float64(0.25 * (re ^ 2.0)));
	else
		tmp = Float64(0.5 * fma(im, im, 2.0));
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[im, 4.1e+19], N[Cos[re], $MachinePrecision], If[LessEqual[im, 1.05e+144], N[(0.25 + N[(0.25 * N[Power[re, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if im < 4.1e19

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0 65.4%

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

   if 4.1e19 < im < 1.04999999999999998e144

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
   2. Add Preprocessing

   4. Applied egg-rr 2.4%

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

   5. Taylor expanded in re around 0 19.9%

      \[\leadsto \color{blue}{0.25 + 0.25 \cdot {re}^{2}} \]
   6. Step-by-step derivation

      1. *-commutative 19.9%

         \[\leadsto 0.25 + \color{blue}{{re}^{2} \cdot 0.25} \]

   7. Simplified 19.9%

      \[\leadsto \color{blue}{0.25 + {re}^{2} \cdot 0.25} \]

   if 1.04999999999999998e144 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0 71.8%

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

   4. Taylor expanded in im around 0 69.6%

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

      1. +-commutative 69.6%

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

      2. unpow2 69.6%

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

      3. fma-def 69.6%

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

   6. Simplified 69.6%

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

4. Final simplification 61.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 4.1 \cdot 10^{+19}:\\ \;\;\;\;\cos re\\ \mathbf{elif}\;im \leq 1.05 \cdot 10^{+144}:\\ \;\;\;\;0.25 + 0.25 \cdot {re}^{2}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \mathsf{fma}\left(im, im, 2\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 65.8% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;im \leq 4.7 \cdot 10^{+32}:\\ \;\;\;\;\cos re\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(2 + 0.002777777777777778 \cdot {im}^{6}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= im 4.7e+32)
   (cos re)
   (* 0.5 (+ 2.0 (* 0.002777777777777778 (pow im 6.0))))))

C

double code(double re, double im) {
	double tmp;
	if (im <= 4.7e+32) {
		tmp = cos(re);
	} else {
		tmp = 0.5 * (2.0 + (0.002777777777777778 * pow(im, 6.0)));
	}
	return tmp;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if (im <= 4.7d+32) then
        tmp = cos(re)
    else
        tmp = 0.5d0 * (2.0d0 + (0.002777777777777778d0 * (im ** 6.0d0)))
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (im <= 4.7e+32) {
		tmp = Math.cos(re);
	} else {
		tmp = 0.5 * (2.0 + (0.002777777777777778 * Math.pow(im, 6.0)));
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if im <= 4.7e+32:
		tmp = math.cos(re)
	else:
		tmp = 0.5 * (2.0 + (0.002777777777777778 * math.pow(im, 6.0)))
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (im <= 4.7e+32)
		tmp = cos(re);
	else
		tmp = Float64(0.5 * Float64(2.0 + Float64(0.002777777777777778 * (im ^ 6.0))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (im <= 4.7e+32)
		tmp = cos(re);
	else
		tmp = 0.5 * (2.0 + (0.002777777777777778 * (im ^ 6.0)));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[im, 4.7e+32], N[Cos[re], $MachinePrecision], N[(0.5 * N[(2.0 + N[(0.002777777777777778 * N[Power[im, 6.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if im < 4.70000000000000023e32

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0 64.2%

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

   if 4.70000000000000023e32 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0 73.0%

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

   4. Taylor expanded in im around 0 68.6%

      \[\leadsto 0.5 \cdot \color{blue}{\left(2 + \left(0.002777777777777778 \cdot {im}^{6} + \left(0.08333333333333333 \cdot {im}^{4} + {im}^{2}\right)\right)\right)} \]

   5. Taylor expanded in im around inf 68.6%

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

4. Final simplification 65.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 4.7 \cdot 10^{+32}:\\ \;\;\;\;\cos re\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(2 + 0.002777777777777778 \cdot {im}^{6}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 59.5% accurate, 2.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;im \leq 0.0095:\\ \;\;\;\;\cos re\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \mathsf{fma}\left(im, im, 2\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= im 0.0095) (cos re) (* 0.5 (fma im im 2.0))))

C

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

Julia

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

Wolfram

code[re_, im_] := If[LessEqual[im, 0.0095], N[Cos[re], $MachinePrecision], N[(0.5 * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if im < 0.00949999999999999976

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0 66.9%

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

   if 0.00949999999999999976 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0 70.8%

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

   4. Taylor expanded in im around 0 40.3%

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

      1. +-commutative 40.3%

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

      2. unpow2 40.3%

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

      3. fma-def 40.3%

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

   6. Simplified 40.3%

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

4. Final simplification 59.4%

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

Alternative 8: 59.5% accurate, 2.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;im \leq 6 \cdot 10^{+83}:\\ \;\;\;\;\cos re\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot {im}^{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= im 6e+83) (cos re) (* 0.5 (pow im 2.0))))

C

double code(double re, double im) {
	double tmp;
	if (im <= 6e+83) {
		tmp = cos(re);
	} else {
		tmp = 0.5 * pow(im, 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 (im <= 6d+83) then
        tmp = cos(re)
    else
        tmp = 0.5d0 * (im ** 2.0d0)
    end if
    code = tmp
end function

Java

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

Python

def code(re, im):
	tmp = 0
	if im <= 6e+83:
		tmp = math.cos(re)
	else:
		tmp = 0.5 * math.pow(im, 2.0)
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (im <= 6e+83)
		tmp = cos(re);
	else
		tmp = Float64(0.5 * (im ^ 2.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (im <= 6e+83)
		tmp = cos(re);
	else
		tmp = 0.5 * (im ^ 2.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[im, 6e+83], N[Cos[re], $MachinePrecision], N[(0.5 * N[Power[im, 2.0], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if im < 5.9999999999999999e83

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0 61.4%

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

   if 5.9999999999999999e83 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
   2. Add Preprocessing

   4. Applied egg-rr 100.0%

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

   5. Taylor expanded in im around 0 72.4%

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

      1. associate-*r* 72.4%

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

      2. distribute-rgt1-in 72.4%

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

   7. Simplified 72.4%

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

   8. Taylor expanded in im around inf 72.4%

      \[\leadsto \color{blue}{0.5 \cdot \left({im}^{2} \cdot \cos re\right)} \]
   9. Step-by-step derivation

      1. associate-*r* 72.4%

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

      2. *-commutative 72.4%

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

   10. Simplified 72.4%

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

   11. Taylor expanded in re around 0 51.7%

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

       1. *-commutative 51.7%

          \[\leadsto \color{blue}{{im}^{2} \cdot 0.5} \]

   13. Simplified 51.7%

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

4. Final simplification 59.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 6 \cdot 10^{+83}:\\ \;\;\;\;\cos re\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot {im}^{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 50.6% accurate, 3.0× speedup

Math

\[\begin{array}{l} \\ \cos re \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (cos re))

C

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

Fortran

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

Java

public static double code(double re, double im) {
	return Math.cos(re);
}

Python

def code(re, im):
	return math.cos(re)

Julia

function code(re, im)
	return cos(re)
end

MATLAB

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

Wolfram

code[re_, im_] := N[Cos[re], $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
2. Add Preprocessing

3. Taylor expanded in im around 0 49.1%

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

4. Final simplification 49.1%

   \[\leadsto \cos re \]
5. Add Preprocessing

Alternative 10: 8.0% accurate, 308.0× speedup

Math

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

FPCore

(FPCore (re im) :precision binary64 0.25)

C

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

Fortran

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

Java

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

Python

def code(re, im):
	return 0.25

Julia

function code(re, im)
	return 0.25
end

MATLAB

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

Wolfram

code[re_, im_] := 0.25

Derivation

1. Initial program 100.0%

   \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
2. Add Preprocessing

4. Applied egg-rr 7.5%

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

5. Taylor expanded in re around 0 7.7%

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

6. Final simplification 7.7%

   \[\leadsto 0.25 \]
7. Add Preprocessing

Alternative 11: 28.6% accurate, 308.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%

   \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
2. Add Preprocessing

3. Taylor expanded in im around 0 49.1%

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

4. Taylor expanded in re around 0 24.6%

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

5. Final simplification 24.6%

   \[\leadsto 1 \]
6. Add Preprocessing

Reproduce

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