math.sin on complex, imaginary part

Percentage Accurate: 53.7% → 99.4%

Time: 8.0s

Alternatives: 10

Speedup: 2.8×

• 48.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: 53.7% 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.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ \begin{array}{l} t_0 := e^{-im\_m} - e^{im\_m}\\ im\_s \cdot \begin{array}{l} \mathbf{if}\;t\_0 \leq -5000000:\\ \;\;\;\;0.5 \cdot \left(t\_0 \cdot \cos re\right)\\ \mathbf{else}:\\ \;\;\;\;{im\_m}^{3} \cdot \left(-0.008333333333333333 \cdot {im\_m}^{2} - 0.16666666666666666\right) - im\_m \cdot \cos re\\ \end{array} \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
 (let* ((t_0 (- (exp (- im_m)) (exp im_m))))
   (*
    im_s
    (if (<= t_0 -5000000.0)
      (* 0.5 (* t_0 (cos re)))
      (-
       (*
        (pow im_m 3.0)
        (- (* -0.008333333333333333 (pow im_m 2.0)) 0.16666666666666666))
       (* im_m (cos re)))))))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	double t_0 = exp(-im_m) - exp(im_m);
	double tmp;
	if (t_0 <= -5000000.0) {
		tmp = 0.5 * (t_0 * cos(re));
	} else {
		tmp = (pow(im_m, 3.0) * ((-0.008333333333333333 * pow(im_m, 2.0)) - 0.16666666666666666)) - (im_m * cos(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) :: t_0
    real(8) :: tmp
    t_0 = exp(-im_m) - exp(im_m)
    if (t_0 <= (-5000000.0d0)) then
        tmp = 0.5d0 * (t_0 * cos(re))
    else
        tmp = ((im_m ** 3.0d0) * (((-0.008333333333333333d0) * (im_m ** 2.0d0)) - 0.16666666666666666d0)) - (im_m * cos(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 t_0 = Math.exp(-im_m) - Math.exp(im_m);
	double tmp;
	if (t_0 <= -5000000.0) {
		tmp = 0.5 * (t_0 * Math.cos(re));
	} else {
		tmp = (Math.pow(im_m, 3.0) * ((-0.008333333333333333 * Math.pow(im_m, 2.0)) - 0.16666666666666666)) - (im_m * Math.cos(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):
	t_0 = math.exp(-im_m) - math.exp(im_m)
	tmp = 0
	if t_0 <= -5000000.0:
		tmp = 0.5 * (t_0 * math.cos(re))
	else:
		tmp = (math.pow(im_m, 3.0) * ((-0.008333333333333333 * math.pow(im_m, 2.0)) - 0.16666666666666666)) - (im_m * math.cos(re))
	return im_s * tmp

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	t_0 = Float64(exp(Float64(-im_m)) - exp(im_m))
	tmp = 0.0
	if (t_0 <= -5000000.0)
		tmp = Float64(0.5 * Float64(t_0 * cos(re)));
	else
		tmp = Float64(Float64((im_m ^ 3.0) * Float64(Float64(-0.008333333333333333 * (im_m ^ 2.0)) - 0.16666666666666666)) - Float64(im_m * cos(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)
	t_0 = exp(-im_m) - exp(im_m);
	tmp = 0.0;
	if (t_0 <= -5000000.0)
		tmp = 0.5 * (t_0 * cos(re));
	else
		tmp = ((im_m ^ 3.0) * ((-0.008333333333333333 * (im_m ^ 2.0)) - 0.16666666666666666)) - (im_m * cos(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_] := Block[{t$95$0 = N[(N[Exp[(-im$95$m)], $MachinePrecision] - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]}, N[(im$95$s * If[LessEqual[t$95$0, -5000000.0], N[(0.5 * N[(t$95$0 * N[Cos[re], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Power[im$95$m, 3.0], $MachinePrecision] * N[(N[(-0.008333333333333333 * N[Power[im$95$m, 2.0], $MachinePrecision]), $MachinePrecision] - 0.16666666666666666), $MachinePrecision]), $MachinePrecision] - N[(im$95$m * N[Cos[re], $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)) < -5e6

   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

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

   1. Initial program 34.1%

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

      1. /-rgt-identity 34.1%

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

      2. exp-0 34.1%

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

      3. associate-*l/ 34.1%

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

      4. cos-neg 34.1%

         \[\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* 34.1%

         \[\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/ 34.1%

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

      7. exp-0 34.1%

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

      8. /-rgt-identity 34.1%

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

      9. *-commutative 34.1%

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

      10. neg-sub0 34.1%

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

      11. cos-neg 34.1%

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

   3. Simplified 34.1%

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

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

   6. Taylor expanded in im around 0 92.4%

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

      1. +-commutative 92.4%

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

      2. mul-1-neg 92.4%

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

      3. unsub-neg 92.4%

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

      4. distribute-lft-out-- 92.5%

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

   8. Simplified 92.5%

      \[\leadsto \color{blue}{\left(\cos re \cdot \left(-0.16666666666666666 + {im}^{2} \cdot -0.008333333333333333\right)\right) \cdot {im}^{3} - im \cdot \cos re} \]

   9. Taylor expanded in re around 0 86.6%

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

4. Final simplification 90.1%

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

Alternative 2: 99.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ \begin{array}{l} t_0 := e^{-im\_m} - e^{im\_m}\\ im\_s \cdot \begin{array}{l} \mathbf{if}\;t\_0 \leq -0.002:\\ \;\;\;\;0.5 \cdot \left(t\_0 \cdot \cos re\right)\\ \mathbf{else}:\\ \;\;\;\;im\_m \cdot \left(-\cos re\right)\\ \end{array} \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
 (let* ((t_0 (- (exp (- im_m)) (exp im_m))))
   (*
    im_s
    (if (<= t_0 -0.002) (* 0.5 (* t_0 (cos re))) (* im_m (- (cos re)))))))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	double t_0 = exp(-im_m) - exp(im_m);
	double tmp;
	if (t_0 <= -0.002) {
		tmp = 0.5 * (t_0 * cos(re));
	} else {
		tmp = im_m * -cos(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) :: t_0
    real(8) :: tmp
    t_0 = exp(-im_m) - exp(im_m)
    if (t_0 <= (-0.002d0)) then
        tmp = 0.5d0 * (t_0 * cos(re))
    else
        tmp = im_m * -cos(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 t_0 = Math.exp(-im_m) - Math.exp(im_m);
	double tmp;
	if (t_0 <= -0.002) {
		tmp = 0.5 * (t_0 * Math.cos(re));
	} else {
		tmp = im_m * -Math.cos(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):
	t_0 = math.exp(-im_m) - math.exp(im_m)
	tmp = 0
	if t_0 <= -0.002:
		tmp = 0.5 * (t_0 * math.cos(re))
	else:
		tmp = im_m * -math.cos(re)
	return im_s * tmp

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	t_0 = Float64(exp(Float64(-im_m)) - exp(im_m))
	tmp = 0.0
	if (t_0 <= -0.002)
		tmp = Float64(0.5 * Float64(t_0 * cos(re)));
	else
		tmp = Float64(im_m * Float64(-cos(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)
	t_0 = exp(-im_m) - exp(im_m);
	tmp = 0.0;
	if (t_0 <= -0.002)
		tmp = 0.5 * (t_0 * cos(re));
	else
		tmp = im_m * -cos(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_] := Block[{t$95$0 = N[(N[Exp[(-im$95$m)], $MachinePrecision] - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]}, N[(im$95$s * If[LessEqual[t$95$0, -0.002], N[(0.5 * N[(t$95$0 * N[Cos[re], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(im$95$m * (-N[Cos[re], $MachinePrecision])), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.9%

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

      1. /-rgt-identity 99.9%

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

      2. exp-0 99.9%

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

      3. associate-*l/ 99.9%

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

      4. cos-neg 99.9%

         \[\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* 99.9%

         \[\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/ 99.9%

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

      7. exp-0 99.9%

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

      8. /-rgt-identity 99.9%

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

      9. *-commutative 99.9%

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

      10. neg-sub0 99.9%

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

      11. cos-neg 99.9%

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

   3. Simplified 99.9%

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

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

   1. Initial program 33.8%

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

      1. /-rgt-identity 33.8%

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

      2. exp-0 33.8%

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

      3. associate-*l/ 33.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 33.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* 33.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/ 33.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 33.8%

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

      8. /-rgt-identity 33.8%

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

      9. *-commutative 33.8%

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

      10. neg-sub0 33.8%

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

      11. cos-neg 33.8%

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

   3. Simplified 33.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 72.7%

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

   6. Taylor expanded in im around 0 72.7%

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

      1. mul-1-neg 72.7%

         \[\leadsto \color{blue}{-im \cdot \cos re} \]

      2. *-commutative 72.7%

         \[\leadsto -\color{blue}{\cos re \cdot im} \]

      3. distribute-rgt-neg-in 72.7%

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

   8. Simplified 72.7%

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

4. Final simplification 79.8%

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

Alternative 3: 96.8% accurate, 1.4× 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 0.00077:\\ \;\;\;\;im\_m \cdot \left(-\cos re\right)\\ \mathbf{elif}\;im\_m \leq 4.5 \cdot 10^{+61}:\\ \;\;\;\;0.5 \cdot \left(e^{-im\_m} - e^{im\_m}\right)\\ \mathbf{else}:\\ \;\;\;\;{im\_m}^{5} \cdot \left(\cos re \cdot -0.008333333333333333\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 0.00077)
    (* im_m (- (cos re)))
    (if (<= im_m 4.5e+61)
      (* 0.5 (- (exp (- im_m)) (exp im_m)))
      (* (pow im_m 5.0) (* (cos re) -0.008333333333333333))))))

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 <= 0.00077) {
		tmp = im_m * -cos(re);
	} else if (im_m <= 4.5e+61) {
		tmp = 0.5 * (exp(-im_m) - exp(im_m));
	} else {
		tmp = pow(im_m, 5.0) * (cos(re) * -0.008333333333333333);
	}
	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 <= 0.00077d0) then
        tmp = im_m * -cos(re)
    else if (im_m <= 4.5d+61) then
        tmp = 0.5d0 * (exp(-im_m) - exp(im_m))
    else
        tmp = (im_m ** 5.0d0) * (cos(re) * (-0.008333333333333333d0))
    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 <= 0.00077) {
		tmp = im_m * -Math.cos(re);
	} else if (im_m <= 4.5e+61) {
		tmp = 0.5 * (Math.exp(-im_m) - Math.exp(im_m));
	} else {
		tmp = Math.pow(im_m, 5.0) * (Math.cos(re) * -0.008333333333333333);
	}
	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 <= 0.00077:
		tmp = im_m * -math.cos(re)
	elif im_m <= 4.5e+61:
		tmp = 0.5 * (math.exp(-im_m) - math.exp(im_m))
	else:
		tmp = math.pow(im_m, 5.0) * (math.cos(re) * -0.008333333333333333)
	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 <= 0.00077)
		tmp = Float64(im_m * Float64(-cos(re)));
	elseif (im_m <= 4.5e+61)
		tmp = Float64(0.5 * Float64(exp(Float64(-im_m)) - exp(im_m)));
	else
		tmp = Float64((im_m ^ 5.0) * Float64(cos(re) * -0.008333333333333333));
	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 <= 0.00077)
		tmp = im_m * -cos(re);
	elseif (im_m <= 4.5e+61)
		tmp = 0.5 * (exp(-im_m) - exp(im_m));
	else
		tmp = (im_m ^ 5.0) * (cos(re) * -0.008333333333333333);
	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, 0.00077], N[(im$95$m * (-N[Cos[re], $MachinePrecision])), $MachinePrecision], If[LessEqual[im$95$m, 4.5e+61], N[(0.5 * N[(N[Exp[(-im$95$m)], $MachinePrecision] - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Power[im$95$m, 5.0], $MachinePrecision] * N[(N[Cos[re], $MachinePrecision] * -0.008333333333333333), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if im < 7.6999999999999996e-4

   1. Initial program 33.8%

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

      1. /-rgt-identity 33.8%

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

      2. exp-0 33.8%

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

      3. associate-*l/ 33.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 33.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* 33.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/ 33.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 33.8%

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

      8. /-rgt-identity 33.8%

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

      9. *-commutative 33.8%

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

      10. neg-sub0 33.8%

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

      11. cos-neg 33.8%

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

   3. Simplified 33.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 72.7%

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

   6. Taylor expanded in im around 0 72.7%

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

      1. mul-1-neg 72.7%

         \[\leadsto \color{blue}{-im \cdot \cos re} \]

      2. *-commutative 72.7%

         \[\leadsto -\color{blue}{\cos re \cdot im} \]

      3. distribute-rgt-neg-in 72.7%

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

   8. Simplified 72.7%

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

   if 7.6999999999999996e-4 < im < 4.5e61

   1. Initial program 99.2%

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

      1. /-rgt-identity 99.2%

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

      2. exp-0 99.2%

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

      3. associate-*l/ 99.2%

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

      4. cos-neg 99.2%

         \[\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* 99.2%

         \[\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/ 99.2%

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

      7. exp-0 99.2%

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

      8. /-rgt-identity 99.2%

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

      9. *-commutative 99.2%

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

      10. neg-sub0 99.2%

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

      11. cos-neg 99.2%

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

   3. Simplified 99.2%

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

   5. Taylor expanded in re around 0 91.5%

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

   6. Taylor expanded in im around inf 91.5%

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

   if 4.5e61 < 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 100.0%

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

   6. Taylor expanded in im around inf 100.0%

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

      1. *-commutative 100.0%

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

      2. associate-*r* 100.0%

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

   8. Simplified 100.0%

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

4. Final simplification 79.4%

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

Alternative 4: 99.1% accurate, 1.4× 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 0.85:\\ \;\;\;\;im\_m \cdot \left(-\cos re\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(\cos re \cdot \left(\left(1 - im\_m\right) - e^{im\_m}\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 0.85)
    (* im_m (- (cos re)))
    (* 0.5 (* (cos re) (- (- 1.0 im_m) (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 <= 0.85) {
		tmp = im_m * -cos(re);
	} else {
		tmp = 0.5 * (cos(re) * ((1.0 - im_m) - 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 <= 0.85d0) then
        tmp = im_m * -cos(re)
    else
        tmp = 0.5d0 * (cos(re) * ((1.0d0 - im_m) - 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 <= 0.85) {
		tmp = im_m * -Math.cos(re);
	} else {
		tmp = 0.5 * (Math.cos(re) * ((1.0 - im_m) - 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 <= 0.85:
		tmp = im_m * -math.cos(re)
	else:
		tmp = 0.5 * (math.cos(re) * ((1.0 - im_m) - 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 <= 0.85)
		tmp = Float64(im_m * Float64(-cos(re)));
	else
		tmp = Float64(0.5 * Float64(cos(re) * Float64(Float64(1.0 - im_m) - 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 <= 0.85)
		tmp = im_m * -cos(re);
	else
		tmp = 0.5 * (cos(re) * ((1.0 - im_m) - 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, 0.85], N[(im$95$m * (-N[Cos[re], $MachinePrecision])), $MachinePrecision], N[(0.5 * N[(N[Cos[re], $MachinePrecision] * N[(N[(1.0 - im$95$m), $MachinePrecision] - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if im < 0.849999999999999978

   1. Initial program 34.1%

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

      1. /-rgt-identity 34.1%

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

      2. exp-0 34.1%

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

      3. associate-*l/ 34.1%

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

      4. cos-neg 34.1%

         \[\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* 34.1%

         \[\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/ 34.1%

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

      7. exp-0 34.1%

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

      8. /-rgt-identity 34.1%

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

      9. *-commutative 34.1%

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

      10. neg-sub0 34.1%

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

      11. cos-neg 34.1%

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

   3. Simplified 34.1%

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

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

   6. Taylor expanded in im around 0 72.6%

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

      1. mul-1-neg 72.6%

         \[\leadsto \color{blue}{-im \cdot \cos re} \]

      2. *-commutative 72.6%

         \[\leadsto -\color{blue}{\cos re \cdot im} \]

      3. distribute-rgt-neg-in 72.6%

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

   8. Simplified 72.6%

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

   if 0.849999999999999978 < 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 100.0%

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

      1. neg-mul-1 100.0%

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

      2. unsub-neg 100.0%

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

   7. Simplified 100.0%

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

4. Final simplification 79.6%

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

Alternative 5: 86.7% accurate, 1.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 0.00152:\\ \;\;\;\;im\_m \cdot \left(-\cos re\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(e^{-im\_m} - 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 0.00152)
    (* im_m (- (cos re)))
    (* 0.5 (- (exp (- im_m)) (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 <= 0.00152) {
		tmp = im_m * -cos(re);
	} else {
		tmp = 0.5 * (exp(-im_m) - 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 <= 0.00152d0) then
        tmp = im_m * -cos(re)
    else
        tmp = 0.5d0 * (exp(-im_m) - 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 <= 0.00152) {
		tmp = im_m * -Math.cos(re);
	} else {
		tmp = 0.5 * (Math.exp(-im_m) - 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 <= 0.00152:
		tmp = im_m * -math.cos(re)
	else:
		tmp = 0.5 * (math.exp(-im_m) - 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 <= 0.00152)
		tmp = Float64(im_m * Float64(-cos(re)));
	else
		tmp = Float64(0.5 * Float64(exp(Float64(-im_m)) - 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 <= 0.00152)
		tmp = im_m * -cos(re);
	else
		tmp = 0.5 * (exp(-im_m) - 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, 0.00152], N[(im$95$m * (-N[Cos[re], $MachinePrecision])), $MachinePrecision], N[(0.5 * N[(N[Exp[(-im$95$m)], $MachinePrecision] - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if im < 0.0015200000000000001

   1. Initial program 33.8%

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

      1. /-rgt-identity 33.8%

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

      2. exp-0 33.8%

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

      3. associate-*l/ 33.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 33.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* 33.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/ 33.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 33.8%

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

      8. /-rgt-identity 33.8%

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

      9. *-commutative 33.8%

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

      10. neg-sub0 33.8%

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

      11. cos-neg 33.8%

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

   3. Simplified 33.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 72.7%

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

   6. Taylor expanded in im around 0 72.7%

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

      1. mul-1-neg 72.7%

         \[\leadsto \color{blue}{-im \cdot \cos re} \]

      2. *-commutative 72.7%

         \[\leadsto -\color{blue}{\cos re \cdot im} \]

      3. distribute-rgt-neg-in 72.7%

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

   8. Simplified 72.7%

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

   if 0.0015200000000000001 < im

   1. Initial program 99.9%

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

      1. /-rgt-identity 99.9%

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

      2. exp-0 99.9%

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

      3. associate-*l/ 99.9%

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

      4. cos-neg 99.9%

         \[\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* 99.9%

         \[\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/ 99.9%

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

      7. exp-0 99.9%

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

      8. /-rgt-identity 99.9%

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

      9. *-commutative 99.9%

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

      10. neg-sub0 99.9%

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

      11. cos-neg 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in re around 0 77.5%

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

   6. Taylor expanded in im around inf 77.5%

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

4. Final simplification 73.9%

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

Alternative 6: 86.6% 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 3.2:\\ \;\;\;\;im\_m \cdot \left(-\cos re\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(\left(1 - im\_m\right) - 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 3.2)
    (* im_m (- (cos re)))
    (* 0.5 (- (- 1.0 im_m) (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 <= 3.2) {
		tmp = im_m * -cos(re);
	} else {
		tmp = 0.5 * ((1.0 - im_m) - 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 <= 3.2d0) then
        tmp = im_m * -cos(re)
    else
        tmp = 0.5d0 * ((1.0d0 - im_m) - 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 <= 3.2) {
		tmp = im_m * -Math.cos(re);
	} else {
		tmp = 0.5 * ((1.0 - im_m) - 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 <= 3.2:
		tmp = im_m * -math.cos(re)
	else:
		tmp = 0.5 * ((1.0 - im_m) - 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 <= 3.2)
		tmp = Float64(im_m * Float64(-cos(re)));
	else
		tmp = Float64(0.5 * Float64(Float64(1.0 - im_m) - 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 <= 3.2)
		tmp = im_m * -cos(re);
	else
		tmp = 0.5 * ((1.0 - im_m) - 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, 3.2], N[(im$95$m * (-N[Cos[re], $MachinePrecision])), $MachinePrecision], N[(0.5 * N[(N[(1.0 - im$95$m), $MachinePrecision] - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if im < 3.2000000000000002

   1. Initial program 34.1%

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

      1. /-rgt-identity 34.1%

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

      2. exp-0 34.1%

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

      3. associate-*l/ 34.1%

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

      4. cos-neg 34.1%

         \[\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* 34.1%

         \[\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/ 34.1%

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

      7. exp-0 34.1%

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

      8. /-rgt-identity 34.1%

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

      9. *-commutative 34.1%

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

      10. neg-sub0 34.1%

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

      11. cos-neg 34.1%

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

   3. Simplified 34.1%

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

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

   6. Taylor expanded in im around 0 72.6%

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

      1. mul-1-neg 72.6%

         \[\leadsto \color{blue}{-im \cdot \cos re} \]

      2. *-commutative 72.6%

         \[\leadsto -\color{blue}{\cos re \cdot im} \]

      3. distribute-rgt-neg-in 72.6%

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

   8. Simplified 72.6%

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

   if 3.2000000000000002 < 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 re around 0 77.3%

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

   6. Taylor expanded in im around inf 77.3%

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

   7. Taylor expanded in im around 0 77.3%

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

      1. neg-mul-1 100.0%

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

      2. unsub-neg 100.0%

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

   9. Simplified 77.3%

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

4. Final simplification 73.8%

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

Alternative 7: 74.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 1.02 \cdot 10^{-8}:\\ \;\;\;\;im\_m \cdot \left(-\cos re\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(im\_m \cdot \left(-0.3333333333333333 \cdot \left(im\_m \cdot im\_m\right) - 2\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 1.02e-8)
    (* im_m (- (cos re)))
    (* 0.5 (* 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 (im_m <= 1.02e-8) {
		tmp = im_m * -cos(re);
	} else {
		tmp = 0.5 * (im_m * ((-0.3333333333333333 * (im_m * im_m)) - 2.0));
	}
	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 <= 1.02d-8) then
        tmp = im_m * -cos(re)
    else
        tmp = 0.5d0 * (im_m * (((-0.3333333333333333d0) * (im_m * im_m)) - 2.0d0))
    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 <= 1.02e-8) {
		tmp = im_m * -Math.cos(re);
	} else {
		tmp = 0.5 * (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 im_m <= 1.02e-8:
		tmp = im_m * -math.cos(re)
	else:
		tmp = 0.5 * (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 (im_m <= 1.02e-8)
		tmp = Float64(im_m * Float64(-cos(re)));
	else
		tmp = Float64(0.5 * 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 (im_m <= 1.02e-8)
		tmp = im_m * -cos(re);
	else
		tmp = 0.5 * (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[im$95$m, 1.02e-8], N[(im$95$m * (-N[Cos[re], $MachinePrecision])), $MachinePrecision], N[(0.5 * N[(im$95$m * N[(N[(-0.3333333333333333 * N[(im$95$m * im$95$m), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if im < 1.02000000000000003e-8

   1. Initial program 33.8%

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

      1. /-rgt-identity 33.8%

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

      2. exp-0 33.8%

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

      3. associate-*l/ 33.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 33.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* 33.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/ 33.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 33.8%

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

      8. /-rgt-identity 33.8%

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

      9. *-commutative 33.8%

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

      10. neg-sub0 33.8%

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

      11. cos-neg 33.8%

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

   3. Simplified 33.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 72.7%

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

   6. Taylor expanded in im around 0 72.7%

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

      1. mul-1-neg 72.7%

         \[\leadsto \color{blue}{-im \cdot \cos re} \]

      2. *-commutative 72.7%

         \[\leadsto -\color{blue}{\cos re \cdot im} \]

      3. distribute-rgt-neg-in 72.7%

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

   8. Simplified 72.7%

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

   if 1.02000000000000003e-8 < im

   1. Initial program 99.9%

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

      1. /-rgt-identity 99.9%

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

      2. exp-0 99.9%

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

      3. associate-*l/ 99.9%

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

      4. cos-neg 99.9%

         \[\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* 99.9%

         \[\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/ 99.9%

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

      7. exp-0 99.9%

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

      8. /-rgt-identity 99.9%

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

      9. *-commutative 99.9%

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

      10. neg-sub0 99.9%

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

      11. cos-neg 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in re around 0 77.5%

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

   6. Taylor expanded in im around 0 53.3%

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

      1. unpow2 53.3%

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

   8. Applied egg-rr 53.3%

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

4. Final simplification 67.6%

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

Alternative 8: 53.2% accurate, 28.1× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ im\_s \cdot \left(0.5 \cdot \left(im\_m \cdot \left(-0.3333333333333333 \cdot \left(im\_m \cdot im\_m\right) - 2\right)\right)\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 (* 0.5 (* 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) {
	return im_s * (0.5 * (im_m * ((-0.3333333333333333 * (im_m * im_m)) - 2.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 * (0.5d0 * (im_m * (((-0.3333333333333333d0) * (im_m * im_m)) - 2.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 * (0.5 * (im_m * ((-0.3333333333333333 * (im_m * im_m)) - 2.0)));
}

Python

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

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	return Float64(im_s * Float64(0.5 * Float64(im_m * Float64(Float64(-0.3333333333333333 * Float64(im_m * im_m)) - 2.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 * (0.5 * (im_m * ((-0.3333333333333333 * (im_m * im_m)) - 2.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 * N[(0.5 * N[(im$95$m * N[(N[(-0.3333333333333333 * N[(im$95$m * im$95$m), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 51.1%

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

   1. /-rgt-identity 51.1%

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

   2. exp-0 51.1%

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

   3. associate-*l/ 51.1%

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

   4. cos-neg 51.1%

      \[\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* 51.1%

      \[\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/ 51.1%

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

   7. exp-0 51.1%

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

   8. /-rgt-identity 51.1%

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

   9. *-commutative 51.1%

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

   10. neg-sub0 51.1%

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

   11. cos-neg 51.1%

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

3. Simplified 51.1%

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

5. Taylor expanded in re around 0 39.4%

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

6. Taylor expanded in im around 0 48.2%

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

   1. unpow2 48.2%

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

8. Applied egg-rr 48.2%

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

9. Final simplification 48.2%

   \[\leadsto 0.5 \cdot \left(im \cdot \left(-0.3333333333333333 \cdot \left(im \cdot im\right) - 2\right)\right) \]
10. Add Preprocessing

Alternative 9: 30.0% 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 51.1%

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

   1. /-rgt-identity 51.1%

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

   2. exp-0 51.1%

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

   3. associate-*l/ 51.1%

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

   4. cos-neg 51.1%

      \[\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* 51.1%

      \[\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/ 51.1%

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

   7. exp-0 51.1%

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

   8. /-rgt-identity 51.1%

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

   9. *-commutative 51.1%

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

   10. neg-sub0 51.1%

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

   11. cos-neg 51.1%

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

3. Simplified 51.1%

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

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

6. Taylor expanded in re around 0 26.9%

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

   1. neg-mul-1 26.9%

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

8. Simplified 26.9%

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

Alternative 10: 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 51.1%

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

   1. /-rgt-identity 51.1%

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

   2. exp-0 51.1%

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

   3. associate-*l/ 51.1%

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

   4. cos-neg 51.1%

      \[\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* 51.1%

      \[\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/ 51.1%

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

   7. exp-0 51.1%

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

   8. /-rgt-identity 51.1%

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

   9. *-commutative 51.1%

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

   10. neg-sub0 51.1%

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

   11. cos-neg 51.1%

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

3. Simplified 51.1%

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

6. Applied egg-rr 2.8%

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

7. Taylor expanded in re around 0 2.8%

   \[\leadsto \color{blue}{-1} \]
8. 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 2024137 
(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))))