math.sin on complex, imaginary part

Percentage Accurate: 54.4% → 99.3%

Time: 7.9s

Alternatives: 7

Speedup: 12.9×

• 49.6% 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^{0 - im} - e^{im}\right) \end{array} \]

FPCore

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

C

double code(double re, double im) {
	return (0.5 * cos(re)) * (exp((0.0 - 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((0.0d0 - im)) - exp(im))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 54.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double re, double im) {
	return (0.5 * cos(re)) * (exp((0.0 - 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((0.0d0 - im)) - exp(im))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ im\_s \cdot \begin{array}{l} \mathbf{if}\;e^{-im\_m} - e^{im\_m} \leq -\infty:\\ \;\;\;\;0.5 \cdot \left(\left(27 - e^{im\_m}\right) \cdot \cos re\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(\cos re \cdot \left(im\_m \cdot \left(-0.3333333333333333 \cdot \left(im\_m \cdot im\_m\right) - 2\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= (- (exp (- im_m)) (exp im_m)) (- INFINITY))
    (* 0.5 (* (- 27.0 (exp im_m)) (cos re)))
    (*
     0.5
     (* (cos re) (* im_m (- (* -0.3333333333333333 (* im_m im_m)) 2.0)))))))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	double tmp;
	if ((exp(-im_m) - exp(im_m)) <= -((double) INFINITY)) {
		tmp = 0.5 * ((27.0 - exp(im_m)) * cos(re));
	} else {
		tmp = 0.5 * (cos(re) * (im_m * ((-0.3333333333333333 * (im_m * im_m)) - 2.0)));
	}
	return im_s * tmp;
}

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	double tmp;
	if ((Math.exp(-im_m) - Math.exp(im_m)) <= -Double.POSITIVE_INFINITY) {
		tmp = 0.5 * ((27.0 - Math.exp(im_m)) * Math.cos(re));
	} else {
		tmp = 0.5 * (Math.cos(re) * (im_m * ((-0.3333333333333333 * (im_m * im_m)) - 2.0)));
	}
	return im_s * tmp;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	tmp = 0
	if (math.exp(-im_m) - math.exp(im_m)) <= -math.inf:
		tmp = 0.5 * ((27.0 - math.exp(im_m)) * math.cos(re))
	else:
		tmp = 0.5 * (math.cos(re) * (im_m * ((-0.3333333333333333 * (im_m * im_m)) - 2.0)))
	return im_s * tmp

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	tmp = 0.0
	if (Float64(exp(Float64(-im_m)) - exp(im_m)) <= Float64(-Inf))
		tmp = Float64(0.5 * Float64(Float64(27.0 - exp(im_m)) * cos(re)));
	else
		tmp = Float64(0.5 * Float64(cos(re) * Float64(im_m * Float64(Float64(-0.3333333333333333 * Float64(im_m * im_m)) - 2.0))));
	end
	return Float64(im_s * tmp)
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp_2 = code(im_s, re, im_m)
	tmp = 0.0;
	if ((exp(-im_m) - exp(im_m)) <= -Inf)
		tmp = 0.5 * ((27.0 - exp(im_m)) * cos(re));
	else
		tmp = 0.5 * (cos(re) * (im_m * ((-0.3333333333333333 * (im_m * im_m)) - 2.0)));
	end
	tmp_2 = im_s * tmp;
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[N[(N[Exp[(-im$95$m)], $MachinePrecision] - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision], (-Infinity)], N[(0.5 * N[(N[(27.0 - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision] * N[Cos[re], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(N[Cos[re], $MachinePrecision] * N[(im$95$m * N[(N[(-0.3333333333333333 * N[(im$95$m * im$95$m), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)) < -inf.0

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 100.0%

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

      2. exp-0 100.0%

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

      3. associate-*l/ 100.0%

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

      4. cos-neg 100.0%

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

      5. associate-*l* 100.0%

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

      6. associate-*r/ 100.0%

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

      7. exp-0 100.0%

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

      8. /-rgt-identity 100.0%

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

      9. *-commutative 100.0%

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

      10. neg-sub0 100.0%

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

      11. cos-neg 100.0%

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

   3. Simplified 100.0%

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

   6. Applied egg-rr 100.0%

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

   if -inf.0 < (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))

   1. Initial program 32.5%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 32.5%

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

      2. exp-0 32.5%

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

      3. associate-*l/ 32.5%

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

      4. cos-neg 32.5%

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

      5. associate-*l* 32.5%

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

      6. associate-*r/ 32.5%

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

      7. exp-0 32.5%

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

      8. /-rgt-identity 32.5%

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

      9. *-commutative 32.5%

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

      10. neg-sub0 32.5%

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

      11. cos-neg 32.5%

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

   3. Simplified 32.5%

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

   5. Taylor expanded in im around 0 90.5%

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

      1. unpow2 90.5%

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

   7. Applied egg-rr 90.5%

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

4. Final simplification 92.9%

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

Alternative 2: 95.3% accurate, 2.5× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ im\_s \cdot \begin{array}{l} \mathbf{if}\;im\_m \leq 125000 \lor \neg \left(im\_m \leq 8.1 \cdot 10^{+102}\right):\\ \;\;\;\;0.5 \cdot \left(\cos re \cdot \left(im\_m \cdot \left(-0.3333333333333333 \cdot \left(im\_m \cdot im\_m\right) - 2\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(27 - e^{im\_m}\right)\\ \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (or (<= im_m 125000.0) (not (<= im_m 8.1e+102)))
    (* 0.5 (* (cos re) (* im_m (- (* -0.3333333333333333 (* im_m im_m)) 2.0))))
    (* 0.5 (- 27.0 (exp im_m))))))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	double tmp;
	if ((im_m <= 125000.0) || !(im_m <= 8.1e+102)) {
		tmp = 0.5 * (cos(re) * (im_m * ((-0.3333333333333333 * (im_m * im_m)) - 2.0)));
	} else {
		tmp = 0.5 * (27.0 - exp(im_m));
	}
	return im_s * tmp;
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if ((im_m <= 125000.0d0) .or. (.not. (im_m <= 8.1d+102))) then
        tmp = 0.5d0 * (cos(re) * (im_m * (((-0.3333333333333333d0) * (im_m * im_m)) - 2.0d0)))
    else
        tmp = 0.5d0 * (27.0d0 - exp(im_m))
    end if
    code = im_s * tmp
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	double tmp;
	if ((im_m <= 125000.0) || !(im_m <= 8.1e+102)) {
		tmp = 0.5 * (Math.cos(re) * (im_m * ((-0.3333333333333333 * (im_m * im_m)) - 2.0)));
	} else {
		tmp = 0.5 * (27.0 - Math.exp(im_m));
	}
	return im_s * tmp;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	tmp = 0
	if (im_m <= 125000.0) or not (im_m <= 8.1e+102):
		tmp = 0.5 * (math.cos(re) * (im_m * ((-0.3333333333333333 * (im_m * im_m)) - 2.0)))
	else:
		tmp = 0.5 * (27.0 - math.exp(im_m))
	return im_s * tmp

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	tmp = 0.0
	if ((im_m <= 125000.0) || !(im_m <= 8.1e+102))
		tmp = Float64(0.5 * Float64(cos(re) * Float64(im_m * Float64(Float64(-0.3333333333333333 * Float64(im_m * im_m)) - 2.0))));
	else
		tmp = Float64(0.5 * Float64(27.0 - exp(im_m)));
	end
	return Float64(im_s * tmp)
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp_2 = code(im_s, re, im_m)
	tmp = 0.0;
	if ((im_m <= 125000.0) || ~((im_m <= 8.1e+102)))
		tmp = 0.5 * (cos(re) * (im_m * ((-0.3333333333333333 * (im_m * im_m)) - 2.0)));
	else
		tmp = 0.5 * (27.0 - exp(im_m));
	end
	tmp_2 = im_s * tmp;
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[Or[LessEqual[im$95$m, 125000.0], N[Not[LessEqual[im$95$m, 8.1e+102]], $MachinePrecision]], N[(0.5 * N[(N[Cos[re], $MachinePrecision] * N[(im$95$m * N[(N[(-0.3333333333333333 * N[(im$95$m * im$95$m), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(27.0 - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if im < 125000 or 8.10000000000000037e102 < im

   1. Initial program 45.8%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 45.8%

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

      2. exp-0 45.8%

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

      3. associate-*l/ 45.8%

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

      4. cos-neg 45.8%

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

      5. associate-*l* 45.8%

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

      6. associate-*r/ 45.8%

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

      7. exp-0 45.8%

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

      8. /-rgt-identity 45.8%

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

      9. *-commutative 45.8%

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

      10. neg-sub0 45.8%

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

      11. cos-neg 45.8%

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

   3. Simplified 45.8%

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

   5. Taylor expanded in im around 0 91.9%

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

      1. unpow2 91.9%

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

   7. Applied egg-rr 91.9%

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

   if 125000 < im < 8.10000000000000037e102

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 100.0%

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

      2. exp-0 100.0%

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

      3. associate-*l/ 100.0%

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

      4. cos-neg 100.0%

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

      5. associate-*l* 100.0%

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

      6. associate-*r/ 100.0%

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

      7. exp-0 100.0%

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

      8. /-rgt-identity 100.0%

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

      9. *-commutative 100.0%

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

      10. neg-sub0 100.0%

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

      11. cos-neg 100.0%

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

   3. Simplified 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in re around 0 70.6%

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

4. Final simplification 90.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 125000 \lor \neg \left(im \leq 8.1 \cdot 10^{+102}\right):\\ \;\;\;\;0.5 \cdot \left(\cos re \cdot \left(im \cdot \left(-0.3333333333333333 \cdot \left(im \cdot im\right) - 2\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(27 - e^{im}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 86.9% accurate, 2.8× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ im\_s \cdot \begin{array}{l} \mathbf{if}\;im\_m \leq 125000:\\ \;\;\;\;\cos re \cdot \left(-im\_m\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(27 - e^{im\_m}\right)\\ \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= im_m 125000.0) (* (cos re) (- im_m)) (* 0.5 (- 27.0 (exp im_m))))))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 125000.0) {
		tmp = cos(re) * -im_m;
	} else {
		tmp = 0.5 * (27.0 - exp(im_m));
	}
	return im_s * tmp;
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (im_m <= 125000.0d0) then
        tmp = cos(re) * -im_m
    else
        tmp = 0.5d0 * (27.0d0 - exp(im_m))
    end if
    code = im_s * tmp
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 125000.0) {
		tmp = Math.cos(re) * -im_m;
	} else {
		tmp = 0.5 * (27.0 - Math.exp(im_m));
	}
	return im_s * tmp;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	tmp = 0
	if im_m <= 125000.0:
		tmp = math.cos(re) * -im_m
	else:
		tmp = 0.5 * (27.0 - math.exp(im_m))
	return im_s * tmp

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	tmp = 0.0
	if (im_m <= 125000.0)
		tmp = Float64(cos(re) * Float64(-im_m));
	else
		tmp = Float64(0.5 * Float64(27.0 - exp(im_m)));
	end
	return Float64(im_s * tmp)
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp_2 = code(im_s, re, im_m)
	tmp = 0.0;
	if (im_m <= 125000.0)
		tmp = cos(re) * -im_m;
	else
		tmp = 0.5 * (27.0 - exp(im_m));
	end
	tmp_2 = im_s * tmp;
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[im$95$m, 125000.0], N[(N[Cos[re], $MachinePrecision] * (-im$95$m)), $MachinePrecision], N[(0.5 * N[(27.0 - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if im < 125000

   1. Initial program 32.8%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 32.8%

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

      2. exp-0 32.8%

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

      3. associate-*l/ 32.8%

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

      4. cos-neg 32.8%

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

      5. associate-*l* 32.8%

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

      6. associate-*r/ 32.8%

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

      7. exp-0 32.8%

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

      8. /-rgt-identity 32.8%

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

      9. *-commutative 32.8%

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

      10. neg-sub0 32.8%

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

      11. cos-neg 32.8%

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

   3. Simplified 32.8%

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

   5. Taylor expanded in im around 0 90.0%

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

   6. Taylor expanded in im around 0 73.2%

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

      1. associate-*r* 73.2%

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

      2. *-commutative 73.2%

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

      3. mul-1-neg 73.2%

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

   8. Simplified 73.2%

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

   if 125000 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 100.0%

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

      2. exp-0 100.0%

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

      3. associate-*l/ 100.0%

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

      4. cos-neg 100.0%

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

      5. associate-*l* 100.0%

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

      6. associate-*r/ 100.0%

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

      7. exp-0 100.0%

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

      8. /-rgt-identity 100.0%

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

      9. *-commutative 100.0%

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

      10. neg-sub0 100.0%

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

      11. cos-neg 100.0%

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

   3. Simplified 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in re around 0 77.8%

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

Alternative 4: 77.8% accurate, 2.8× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ im\_s \cdot \begin{array}{l} \mathbf{if}\;im\_m \leq 600:\\ \;\;\;\;\cos re \cdot \left(-im\_m\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(\left(im\_m \cdot \left(-0.3333333333333333 \cdot \left(im\_m \cdot im\_m\right) - 2\right)\right) \cdot \left(1 + -0.5 \cdot \left(re \cdot re\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= im_m 600.0)
    (* (cos re) (- im_m))
    (*
     0.5
     (*
      (* im_m (- (* -0.3333333333333333 (* im_m im_m)) 2.0))
      (+ 1.0 (* -0.5 (* re re))))))))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 600.0) {
		tmp = cos(re) * -im_m;
	} else {
		tmp = 0.5 * ((im_m * ((-0.3333333333333333 * (im_m * im_m)) - 2.0)) * (1.0 + (-0.5 * (re * re))));
	}
	return im_s * tmp;
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (im_m <= 600.0d0) then
        tmp = cos(re) * -im_m
    else
        tmp = 0.5d0 * ((im_m * (((-0.3333333333333333d0) * (im_m * im_m)) - 2.0d0)) * (1.0d0 + ((-0.5d0) * (re * re))))
    end if
    code = im_s * tmp
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 600.0) {
		tmp = Math.cos(re) * -im_m;
	} else {
		tmp = 0.5 * ((im_m * ((-0.3333333333333333 * (im_m * im_m)) - 2.0)) * (1.0 + (-0.5 * (re * re))));
	}
	return im_s * tmp;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	tmp = 0
	if im_m <= 600.0:
		tmp = math.cos(re) * -im_m
	else:
		tmp = 0.5 * ((im_m * ((-0.3333333333333333 * (im_m * im_m)) - 2.0)) * (1.0 + (-0.5 * (re * re))))
	return im_s * tmp

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	tmp = 0.0
	if (im_m <= 600.0)
		tmp = Float64(cos(re) * Float64(-im_m));
	else
		tmp = Float64(0.5 * Float64(Float64(im_m * Float64(Float64(-0.3333333333333333 * Float64(im_m * im_m)) - 2.0)) * Float64(1.0 + Float64(-0.5 * Float64(re * re)))));
	end
	return Float64(im_s * tmp)
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp_2 = code(im_s, re, im_m)
	tmp = 0.0;
	if (im_m <= 600.0)
		tmp = cos(re) * -im_m;
	else
		tmp = 0.5 * ((im_m * ((-0.3333333333333333 * (im_m * im_m)) - 2.0)) * (1.0 + (-0.5 * (re * re))));
	end
	tmp_2 = im_s * tmp;
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[im$95$m, 600.0], N[(N[Cos[re], $MachinePrecision] * (-im$95$m)), $MachinePrecision], N[(0.5 * N[(N[(im$95$m * N[(N[(-0.3333333333333333 * N[(im$95$m * im$95$m), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(-0.5 * N[(re * re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if im < 600

   1. Initial program 32.5%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 32.5%

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

      2. exp-0 32.5%

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

      3. associate-*l/ 32.5%

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

      4. cos-neg 32.5%

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

      5. associate-*l* 32.5%

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

      6. associate-*r/ 32.5%

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

      7. exp-0 32.5%

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

      8. /-rgt-identity 32.5%

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

      9. *-commutative 32.5%

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

      10. neg-sub0 32.5%

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

      11. cos-neg 32.5%

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

   3. Simplified 32.5%

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

   5. Taylor expanded in im around 0 90.5%

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

   6. Taylor expanded in im around 0 73.6%

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

      1. associate-*r* 73.6%

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

      2. *-commutative 73.6%

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

      3. mul-1-neg 73.6%

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

   8. Simplified 73.6%

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

   if 600 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 100.0%

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

      2. exp-0 100.0%

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

      3. associate-*l/ 100.0%

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

      4. cos-neg 100.0%

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

      5. associate-*l* 100.0%

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

      6. associate-*r/ 100.0%

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

      7. exp-0 100.0%

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

      8. /-rgt-identity 100.0%

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

      9. *-commutative 100.0%

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

      10. neg-sub0 100.0%

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

      11. cos-neg 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in im around 0 73.5%

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

      1. unpow2 73.5%

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

   7. Applied egg-rr 73.5%

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

   8. Taylor expanded in re around 0 66.4%

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

      1. unpow2 66.4%

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

   10. Applied egg-rr 66.4%

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

Alternative 5: 55.7% accurate, 12.9× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ im\_s \cdot \begin{array}{l} \mathbf{if}\;im\_m \leq 86:\\ \;\;\;\;-im\_m\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(\left(im\_m \cdot \left(-0.3333333333333333 \cdot \left(im\_m \cdot im\_m\right) - 2\right)\right) \cdot \left(1 + -0.5 \cdot \left(re \cdot re\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= im_m 86.0)
    (- im_m)
    (*
     0.5
     (*
      (* im_m (- (* -0.3333333333333333 (* im_m im_m)) 2.0))
      (+ 1.0 (* -0.5 (* re re))))))))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 86.0) {
		tmp = -im_m;
	} else {
		tmp = 0.5 * ((im_m * ((-0.3333333333333333 * (im_m * im_m)) - 2.0)) * (1.0 + (-0.5 * (re * re))));
	}
	return im_s * tmp;
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (im_m <= 86.0d0) then
        tmp = -im_m
    else
        tmp = 0.5d0 * ((im_m * (((-0.3333333333333333d0) * (im_m * im_m)) - 2.0d0)) * (1.0d0 + ((-0.5d0) * (re * re))))
    end if
    code = im_s * tmp
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 86.0) {
		tmp = -im_m;
	} else {
		tmp = 0.5 * ((im_m * ((-0.3333333333333333 * (im_m * im_m)) - 2.0)) * (1.0 + (-0.5 * (re * re))));
	}
	return im_s * tmp;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	tmp = 0
	if im_m <= 86.0:
		tmp = -im_m
	else:
		tmp = 0.5 * ((im_m * ((-0.3333333333333333 * (im_m * im_m)) - 2.0)) * (1.0 + (-0.5 * (re * re))))
	return im_s * tmp

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	tmp = 0.0
	if (im_m <= 86.0)
		tmp = Float64(-im_m);
	else
		tmp = Float64(0.5 * Float64(Float64(im_m * Float64(Float64(-0.3333333333333333 * Float64(im_m * im_m)) - 2.0)) * Float64(1.0 + Float64(-0.5 * Float64(re * re)))));
	end
	return Float64(im_s * tmp)
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp_2 = code(im_s, re, im_m)
	tmp = 0.0;
	if (im_m <= 86.0)
		tmp = -im_m;
	else
		tmp = 0.5 * ((im_m * ((-0.3333333333333333 * (im_m * im_m)) - 2.0)) * (1.0 + (-0.5 * (re * re))));
	end
	tmp_2 = im_s * tmp;
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[im$95$m, 86.0], (-im$95$m), N[(0.5 * N[(N[(im$95$m * N[(N[(-0.3333333333333333 * N[(im$95$m * im$95$m), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(-0.5 * N[(re * re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if im < 86

   1. Initial program 32.5%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 32.5%

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

      2. exp-0 32.5%

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

      3. associate-*l/ 32.5%

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

      4. cos-neg 32.5%

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

      5. associate-*l* 32.5%

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

      6. associate-*r/ 32.5%

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

      7. exp-0 32.5%

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

      8. /-rgt-identity 32.5%

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

      9. *-commutative 32.5%

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

      10. neg-sub0 32.5%

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

      11. cos-neg 32.5%

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

   3. Simplified 32.5%

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

   5. Taylor expanded in im around 0 73.6%

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

   6. Taylor expanded in re around 0 39.8%

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

      1. mul-1-neg 39.8%

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

   8. Simplified 39.8%

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

   if 86 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Step-by-step derivation

      1. /-rgt-identity 100.0%

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

      2. exp-0 100.0%

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

      3. associate-*l/ 100.0%

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

      4. cos-neg 100.0%

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

      5. associate-*l* 100.0%

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

      6. associate-*r/ 100.0%

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

      7. exp-0 100.0%

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

      8. /-rgt-identity 100.0%

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

      9. *-commutative 100.0%

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

      10. neg-sub0 100.0%

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

      11. cos-neg 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in im around 0 73.5%

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

      1. unpow2 73.5%

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

   7. Applied egg-rr 73.5%

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

   8. Taylor expanded in re around 0 66.4%

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

      1. unpow2 66.4%

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

   10. Applied egg-rr 66.4%

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

Alternative 6: 29.3% accurate, 154.5× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ im\_s \cdot \left(-im\_m\right) \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m) :precision binary64 (* im_s (- im_m)))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	return im_s * -im_m;
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    code = im_s * -im_m
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	return im_s * -im_m;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	return im_s * -im_m

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	return Float64(im_s * Float64(-im_m))
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp = code(im_s, re, im_m)
	tmp = im_s * -im_m;
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * (-im$95$m)), $MachinePrecision]

Derivation

1. Initial program 49.4%

   \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
2. Step-by-step derivation

   1. /-rgt-identity 49.4%

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

   2. exp-0 49.4%

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

   3. associate-*l/ 49.4%

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

   4. cos-neg 49.4%

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

   5. associate-*l* 49.4%

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

   6. associate-*r/ 49.4%

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

   7. exp-0 49.4%

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

   8. /-rgt-identity 49.4%

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

   9. *-commutative 49.4%

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

   10. neg-sub0 49.4%

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

   11. cos-neg 49.4%

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

3. Simplified 49.4%

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

5. Taylor expanded in im around 0 56.7%

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

6. Taylor expanded in re around 0 31.0%

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

   1. mul-1-neg 31.0%

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

8. Simplified 31.0%

   \[\leadsto \color{blue}{-im} \]
9. Add Preprocessing

Alternative 7: 3.6% accurate, 309.0× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ im\_s \cdot -1 \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m) :precision binary64 (* im_s -1.0))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	return im_s * -1.0;
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    code = im_s * (-1.0d0)
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	return im_s * -1.0;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	return im_s * -1.0

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	return Float64(im_s * -1.0)
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp = code(im_s, re, im_m)
	tmp = im_s * -1.0;
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * -1.0), $MachinePrecision]

Derivation

1. Initial program 49.4%

   \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
2. Step-by-step derivation

   1. /-rgt-identity 49.4%

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

   2. exp-0 49.4%

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

   3. associate-*l/ 49.4%

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

   4. cos-neg 49.4%

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

   5. associate-*l* 49.4%

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

   6. associate-*r/ 49.4%

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

   7. exp-0 49.4%

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

   8. /-rgt-identity 49.4%

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

   9. *-commutative 49.4%

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

   10. neg-sub0 49.4%

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

   11. cos-neg 49.4%

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

3. Simplified 49.4%

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

6. Applied egg-rr 3.1%

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

   1. metadata-eval 3.1%

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

8. Applied egg-rr 3.1%

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

Developer Target 1: 99.8% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024185 
(FPCore (re im)
  :name "math.sin on complex, imaginary part"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< (fabs im) 1) (- (* (cos re) (+ im (* 1/6 im im im) (* 1/120 im im im im im)))) (* (* 1/2 (cos re)) (- (exp (- 0 im)) (exp im)))))

  (* (* 0.5 (cos re)) (- (exp (- 0.0 im)) (exp im))))