math.sin on complex, imaginary part

Percentage Accurate: 53.6% → 99.6%

Time: 6.7s

Alternatives: 10

Speedup: 2.8×

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

Specification

Math

\[\begin{array}{l} \\ \left(0.5 \cdot \cos re\right) \cdot \left(e^{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.6% 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.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.1:\\ \;\;\;\;0.5 \cdot \left(t\_0 \cdot \cos re\right)\\ \mathbf{else}:\\ \;\;\;\;\left(-im\_m\right) \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 -0.1) (* 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.1) {
		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.1d0)) 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.1) {
		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.1:
		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.1)
		tmp = Float64(0.5 * Float64(t_0 * cos(re)));
	else
		tmp = Float64(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 <= -0.1)
		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.1], 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)) < -0.10000000000000001

   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 -0.10000000000000001 < (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))

   1. Initial program 37.5%

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

      1. /-rgt-identity 37.5%

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

      2. exp-0 37.5%

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

      3. associate-*l/ 37.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 37.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* 37.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/ 37.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 37.5%

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

      8. /-rgt-identity 37.5%

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

      9. *-commutative 37.5%

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

      10. neg-sub0 37.5%

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

      11. cos-neg 37.5%

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

   3. Simplified 37.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 68.5%

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

   6. Taylor expanded in im around 0 68.5%

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

      1. associate-*r* 68.5%

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

      2. *-commutative 68.5%

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

      3. mul-1-neg 68.5%

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

   8. Simplified 68.5%

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

4. Final simplification 76.4%

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

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

Derivation

1. Split input into 2 regimes

2. if im < 3.5

   1. Initial program 37.5%

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

      1. /-rgt-identity 37.5%

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

      2. exp-0 37.5%

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

      3. associate-*l/ 37.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 37.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* 37.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/ 37.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 37.5%

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

      8. /-rgt-identity 37.5%

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

      9. *-commutative 37.5%

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

      10. neg-sub0 37.5%

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

      11. cos-neg 37.5%

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

   3. Simplified 37.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 68.5%

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

   6. Taylor expanded in im around 0 68.5%

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

      1. associate-*r* 68.5%

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

      2. *-commutative 68.5%

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

      3. mul-1-neg 68.5%

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

   8. Simplified 68.5%

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

   if 3.5 < 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 99.1%

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

4. Final simplification 76.2%

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

Alternative 3: 86.4% 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.0022:\\ \;\;\;\;\left(-im\_m\right) \cdot \cos re\\ \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.0022)
    (* (- 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.0022) {
		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.0022d0) 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.0022) {
		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.0022:
		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.0022)
		tmp = Float64(Float64(-im_m) * 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.0022)
		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.0022], 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.00220000000000000013

   1. Initial program 37.5%

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

      1. /-rgt-identity 37.5%

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

      2. exp-0 37.5%

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

      3. associate-*l/ 37.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 37.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* 37.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/ 37.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 37.5%

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

      8. /-rgt-identity 37.5%

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

      9. *-commutative 37.5%

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

      10. neg-sub0 37.5%

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

      11. cos-neg 37.5%

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

   3. Simplified 37.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 68.5%

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

   6. Taylor expanded in im around 0 68.5%

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

      1. associate-*r* 68.5%

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

      2. *-commutative 68.5%

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

      3. mul-1-neg 68.5%

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

   8. Simplified 68.5%

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

   if 0.00220000000000000013 < 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 85.9%

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

4. Final simplification 72.9%

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

Alternative 4: 86.2% 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 450:\\ \;\;\;\;\left(-im\_m\right) \cdot \cos re\\ \mathbf{else}:\\ \;\;\;\;\mathsf{log1p}\left(\mathsf{expm1}\left(im\_m \cdot -5\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 450.0) (* (- im_m) (cos re)) (log1p (expm1 (* im_m -5.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 <= 450.0) {
		tmp = -im_m * cos(re);
	} else {
		tmp = log1p(expm1((im_m * -5.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 (im_m <= 450.0) {
		tmp = -im_m * Math.cos(re);
	} else {
		tmp = Math.log1p(Math.expm1((im_m * -5.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 <= 450.0:
		tmp = -im_m * math.cos(re)
	else:
		tmp = math.log1p(math.expm1((im_m * -5.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 <= 450.0)
		tmp = Float64(Float64(-im_m) * cos(re));
	else
		tmp = log1p(expm1(Float64(im_m * -5.0)));
	end
	return Float64(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, 450.0], N[((-im$95$m) * N[Cos[re], $MachinePrecision]), $MachinePrecision], N[Log[1 + N[(Exp[N[(im$95$m * -5.0), $MachinePrecision]] - 1), $MachinePrecision]], $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if im < 450

   1. Initial program 37.9%

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

      1. /-rgt-identity 37.9%

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

      2. exp-0 37.9%

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

      3. associate-*l/ 37.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 37.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* 37.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/ 37.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 37.9%

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

      8. /-rgt-identity 37.9%

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

      9. *-commutative 37.9%

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

      10. neg-sub0 37.9%

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

      11. cos-neg 37.9%

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

   3. Simplified 37.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 im around 0 68.2%

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

   6. Taylor expanded in im around 0 68.2%

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

      1. associate-*r* 68.2%

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

      2. *-commutative 68.2%

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

      3. mul-1-neg 68.2%

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

   8. Simplified 68.2%

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

   if 450 < 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 5.3%

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

   7. Applied egg-rr 4.7%

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

      1. sub-neg 4.7%

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

      2. log1p-undefine 4.7%

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

      3. rem-exp-log 4.7%

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

      4. +-commutative 4.7%

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

      5. metadata-eval 4.7%

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

   9. Simplified 4.7%

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

   10. Taylor expanded in re around 0 4.7%

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

       1. *-commutative 4.7%

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

   12. Simplified 4.7%

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

       1. log1p-expm1-u 85.7%

          \[\leadsto \color{blue}{\mathsf{log1p}\left(\mathsf{expm1}\left(im \cdot -5\right)\right)} \]

   14. Applied egg-rr 85.7%

       \[\leadsto \color{blue}{\mathsf{log1p}\left(\mathsf{expm1}\left(im \cdot -5\right)\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 72.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 450:\\ \;\;\;\;\left(-im\right) \cdot \cos re\\ \mathbf{else}:\\ \;\;\;\;\mathsf{log1p}\left(\mathsf{expm1}\left(im \cdot -5\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 60.7% accurate, 2.6× 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 1800000:\\ \;\;\;\;\left(-im\_m\right) \cdot \cos re\\ \mathbf{elif}\;im\_m \leq 8.2 \cdot 10^{+37}:\\ \;\;\;\;0.5 \cdot \left(im\_m \cdot \mathsf{fma}\left(re, re, -2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;im\_m \cdot \left(-1 + -1.5 \cdot {re}^{2}\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 1800000.0)
    (* (- im_m) (cos re))
    (if (<= im_m 8.2e+37)
      (* 0.5 (* im_m (fma re re -2.0)))
      (* im_m (+ -1.0 (* -1.5 (pow re 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 <= 1800000.0) {
		tmp = -im_m * cos(re);
	} else if (im_m <= 8.2e+37) {
		tmp = 0.5 * (im_m * fma(re, re, -2.0));
	} else {
		tmp = im_m * (-1.0 + (-1.5 * pow(re, 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 <= 1800000.0)
		tmp = Float64(Float64(-im_m) * cos(re));
	elseif (im_m <= 8.2e+37)
		tmp = Float64(0.5 * Float64(im_m * fma(re, re, -2.0)));
	else
		tmp = Float64(im_m * Float64(-1.0 + Float64(-1.5 * (re ^ 2.0))));
	end
	return Float64(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, 1800000.0], N[((-im$95$m) * N[Cos[re], $MachinePrecision]), $MachinePrecision], If[LessEqual[im$95$m, 8.2e+37], N[(0.5 * N[(im$95$m * N[(re * re + -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(im$95$m * N[(-1.0 + N[(-1.5 * N[Power[re, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if im < 1.8e6

   1. Initial program 38.2%

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

      1. /-rgt-identity 38.2%

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

      2. exp-0 38.2%

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

      3. associate-*l/ 38.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 38.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* 38.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/ 38.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 38.2%

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

      8. /-rgt-identity 38.2%

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

      9. *-commutative 38.2%

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

      10. neg-sub0 38.2%

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

      11. cos-neg 38.2%

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

   3. Simplified 38.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 im around 0 67.9%

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

   6. Taylor expanded in im around 0 67.9%

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

      1. associate-*r* 67.9%

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

      2. *-commutative 67.9%

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

      3. mul-1-neg 67.9%

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

   8. Simplified 67.9%

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

   if 1.8e6 < im < 8.1999999999999996e37

   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 3.3%

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

   6. Taylor expanded in re around 0 17.2%

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

      1. *-commutative 17.2%

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

      2. distribute-lft-out 17.2%

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

      3. +-commutative 17.2%

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

      4. unpow2 17.2%

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

      5. fma-define 17.2%

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

   8. Simplified 17.2%

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

   if 8.1999999999999996e37 < 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 5.6%

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

   6. Taylor expanded in im around 0 5.6%

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

      1. associate-*r* 5.6%

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

      2. *-commutative 5.6%

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

      3. mul-1-neg 5.6%

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

   8. Simplified 5.6%

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

   10. Applied egg-rr 5.6%

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

   11. Taylor expanded in re around 0 32.4%

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

       1. associate-*r* 32.4%

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

       2. +-commutative 32.4%

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

       3. *-commutative 32.4%

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

       4. *-commutative 32.4%

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

       5. associate-*l* 32.4%

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

       6. distribute-lft-out 32.4%

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

   13. Simplified 32.4%

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

4. Final simplification 58.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 1800000:\\ \;\;\;\;\left(-im\right) \cdot \cos re\\ \mathbf{elif}\;im \leq 8.2 \cdot 10^{+37}:\\ \;\;\;\;0.5 \cdot \left(im \cdot \mathsf{fma}\left(re, re, -2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;im \cdot \left(-1 + -1.5 \cdot {re}^{2}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 61.3% 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 1950000:\\ \;\;\;\;\left(-im\_m\right) \cdot \cos re\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(im\_m \cdot \mathsf{fma}\left(re, re, -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 1950000.0)
    (* (- im_m) (cos re))
    (* 0.5 (* im_m (fma re re -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 <= 1950000.0) {
		tmp = -im_m * cos(re);
	} else {
		tmp = 0.5 * (im_m * fma(re, re, -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 <= 1950000.0)
		tmp = Float64(Float64(-im_m) * cos(re));
	else
		tmp = Float64(0.5 * Float64(im_m * fma(re, re, -2.0)));
	end
	return Float64(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, 1950000.0], N[((-im$95$m) * N[Cos[re], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(im$95$m * N[(re * re + -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if im < 1.95e6

   1. Initial program 38.2%

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

      1. /-rgt-identity 38.2%

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

      2. exp-0 38.2%

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

      3. associate-*l/ 38.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 38.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* 38.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/ 38.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 38.2%

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

      8. /-rgt-identity 38.2%

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

      9. *-commutative 38.2%

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

      10. neg-sub0 38.2%

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

      11. cos-neg 38.2%

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

   3. Simplified 38.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 im around 0 67.9%

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

   6. Taylor expanded in im around 0 67.9%

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

      1. associate-*r* 67.9%

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

      2. *-commutative 67.9%

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

      3. mul-1-neg 67.9%

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

   8. Simplified 67.9%

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

   if 1.95e6 < 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 5.3%

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

   6. Taylor expanded in re around 0 15.9%

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

      1. *-commutative 15.9%

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

      2. distribute-lft-out 15.9%

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

      3. +-commutative 15.9%

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

      4. unpow2 15.9%

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

      5. fma-define 15.9%

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

   8. Simplified 15.9%

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

4. Final simplification 55.3%

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

Alternative 7: 60.2% 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 1800000:\\ \;\;\;\;\left(-im\_m\right) \cdot \cos re\\ \mathbf{else}:\\ \;\;\;\;{re}^{2} \cdot \left(im\_m \cdot 0.5\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 1800000.0)
    (* (- im_m) (cos re))
    (* (pow re 2.0) (* im_m 0.5)))))

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 <= 1800000.0) {
		tmp = -im_m * cos(re);
	} else {
		tmp = pow(re, 2.0) * (im_m * 0.5);
	}
	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 <= 1800000.0d0) then
        tmp = -im_m * cos(re)
    else
        tmp = (re ** 2.0d0) * (im_m * 0.5d0)
    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 <= 1800000.0) {
		tmp = -im_m * Math.cos(re);
	} else {
		tmp = Math.pow(re, 2.0) * (im_m * 0.5);
	}
	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 <= 1800000.0:
		tmp = -im_m * math.cos(re)
	else:
		tmp = math.pow(re, 2.0) * (im_m * 0.5)
	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 <= 1800000.0)
		tmp = Float64(Float64(-im_m) * cos(re));
	else
		tmp = Float64((re ^ 2.0) * Float64(im_m * 0.5));
	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 <= 1800000.0)
		tmp = -im_m * cos(re);
	else
		tmp = (re ^ 2.0) * (im_m * 0.5);
	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, 1800000.0], N[((-im$95$m) * N[Cos[re], $MachinePrecision]), $MachinePrecision], N[(N[Power[re, 2.0], $MachinePrecision] * N[(im$95$m * 0.5), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if im < 1.8e6

   1. Initial program 38.2%

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

      1. /-rgt-identity 38.2%

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

      2. exp-0 38.2%

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

      3. associate-*l/ 38.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 38.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* 38.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/ 38.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 38.2%

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

      8. /-rgt-identity 38.2%

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

      9. *-commutative 38.2%

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

      10. neg-sub0 38.2%

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

      11. cos-neg 38.2%

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

   3. Simplified 38.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 im around 0 67.9%

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

   6. Taylor expanded in im around 0 67.9%

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

      1. associate-*r* 67.9%

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

      2. *-commutative 67.9%

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

      3. mul-1-neg 67.9%

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

   8. Simplified 67.9%

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

   if 1.8e6 < 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 5.3%

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

   6. Taylor expanded in re around 0 15.9%

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

      1. *-commutative 15.9%

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

      2. distribute-lft-out 15.9%

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

      3. +-commutative 15.9%

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

      4. unpow2 15.9%

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

      5. fma-define 15.9%

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

   8. Simplified 15.9%

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

   9. Taylor expanded in re around inf 13.6%

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

       1. associate-*r* 13.6%

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

       2. *-commutative 13.6%

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

       3. *-commutative 13.6%

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

   11. Simplified 13.6%

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

4. Final simplification 54.8%

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

Alternative 8: 52.7% accurate, 3.0× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ im\_s \cdot \left(\left(-im\_m\right) \cdot \cos re\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) (cos re))))

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 * cos(re));
}

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 * cos(re))
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 * Math.cos(re));
}

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 * math.cos(re))

Julia

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

Derivation

1. Initial program 53.2%

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

   1. /-rgt-identity 53.2%

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

   2. exp-0 53.2%

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

   3. associate-*l/ 53.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 53.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* 53.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/ 53.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 53.2%

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

   8. /-rgt-identity 53.2%

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

   9. *-commutative 53.2%

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

   10. neg-sub0 53.2%

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

   11. cos-neg 53.2%

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

3. Simplified 53.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 im around 0 52.8%

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

6. Taylor expanded in im around 0 52.8%

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

   1. associate-*r* 52.8%

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

   2. *-commutative 52.8%

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

   3. mul-1-neg 52.8%

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

8. Simplified 52.8%

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

9. Final simplification 52.8%

   \[\leadsto \left(-im\right) \cdot \cos re \]
10. Add Preprocessing

Alternative 9: 30.2% 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 53.2%

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

   1. /-rgt-identity 53.2%

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

   2. exp-0 53.2%

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

   3. associate-*l/ 53.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 53.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* 53.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/ 53.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 53.2%

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

   8. /-rgt-identity 53.2%

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

   9. *-commutative 53.2%

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

   10. neg-sub0 53.2%

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

   11. cos-neg 53.2%

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

3. Simplified 53.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 im around 0 52.8%

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

6. Taylor expanded in re around 0 31.1%

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

   1. mul-1-neg 31.1%

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

8. Simplified 31.1%

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

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

   1. /-rgt-identity 53.2%

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

   2. exp-0 53.2%

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

   3. associate-*l/ 53.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 53.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* 53.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/ 53.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 53.2%

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

   8. /-rgt-identity 53.2%

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

   9. *-commutative 53.2%

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

   10. neg-sub0 53.2%

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

   11. cos-neg 53.2%

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

3. Simplified 53.2%

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

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

   1. metadata-eval 2.9%

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

8. Applied egg-rr 2.9%

   \[\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 2024170 
(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))))