math.cos on complex, imaginary part

Percentage Accurate: 66.3% → 99.9%

Time: 9.5s

Alternatives: 15

Speedup: 2.9×

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 66.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% 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}\\ t_1 := 0.5 \cdot \sin re\\ im_s \cdot \begin{array}{l} \mathbf{if}\;t_0 \leq -0.2:\\ \;\;\;\;t_0 \cdot t_1\\ \mathbf{else}:\\ \;\;\;\;t_1 \cdot \left(im_m \cdot -2 + \left(-0.3333333333333333 \cdot {im_m}^{3} + -0.016666666666666666 \cdot {im_m}^{5}\right)\right)\\ \end{array} \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
im_s = (copysign.f64 1 im)
(FPCore (im_s re im_m)
 :precision binary64
 (let* ((t_0 (- (exp (- im_m)) (exp im_m))) (t_1 (* 0.5 (sin re))))
   (*
    im_s
    (if (<= t_0 -0.2)
      (* t_0 t_1)
      (*
       t_1
       (+
        (* im_m -2.0)
        (+
         (* -0.3333333333333333 (pow im_m 3.0))
         (* -0.016666666666666666 (pow 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 t_0 = exp(-im_m) - exp(im_m);
	double t_1 = 0.5 * sin(re);
	double tmp;
	if (t_0 <= -0.2) {
		tmp = t_0 * t_1;
	} else {
		tmp = t_1 * ((im_m * -2.0) + ((-0.3333333333333333 * pow(im_m, 3.0)) + (-0.016666666666666666 * pow(im_m, 5.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) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = exp(-im_m) - exp(im_m)
    t_1 = 0.5d0 * sin(re)
    if (t_0 <= (-0.2d0)) then
        tmp = t_0 * t_1
    else
        tmp = t_1 * ((im_m * (-2.0d0)) + (((-0.3333333333333333d0) * (im_m ** 3.0d0)) + ((-0.016666666666666666d0) * (im_m ** 5.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 t_0 = Math.exp(-im_m) - Math.exp(im_m);
	double t_1 = 0.5 * Math.sin(re);
	double tmp;
	if (t_0 <= -0.2) {
		tmp = t_0 * t_1;
	} else {
		tmp = t_1 * ((im_m * -2.0) + ((-0.3333333333333333 * Math.pow(im_m, 3.0)) + (-0.016666666666666666 * Math.pow(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):
	t_0 = math.exp(-im_m) - math.exp(im_m)
	t_1 = 0.5 * math.sin(re)
	tmp = 0
	if t_0 <= -0.2:
		tmp = t_0 * t_1
	else:
		tmp = t_1 * ((im_m * -2.0) + ((-0.3333333333333333 * math.pow(im_m, 3.0)) + (-0.016666666666666666 * math.pow(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)
	t_0 = Float64(exp(Float64(-im_m)) - exp(im_m))
	t_1 = Float64(0.5 * sin(re))
	tmp = 0.0
	if (t_0 <= -0.2)
		tmp = Float64(t_0 * t_1);
	else
		tmp = Float64(t_1 * Float64(Float64(im_m * -2.0) + Float64(Float64(-0.3333333333333333 * (im_m ^ 3.0)) + Float64(-0.016666666666666666 * (im_m ^ 5.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)
	t_0 = exp(-im_m) - exp(im_m);
	t_1 = 0.5 * sin(re);
	tmp = 0.0;
	if (t_0 <= -0.2)
		tmp = t_0 * t_1;
	else
		tmp = t_1 * ((im_m * -2.0) + ((-0.3333333333333333 * (im_m ^ 3.0)) + (-0.016666666666666666 * (im_m ^ 5.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_] := Block[{t$95$0 = N[(N[Exp[(-im$95$m)], $MachinePrecision] - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision]}, N[(im$95$s * If[LessEqual[t$95$0, -0.2], N[(t$95$0 * t$95$1), $MachinePrecision], N[(t$95$1 * N[(N[(im$95$m * -2.0), $MachinePrecision] + N[(N[(-0.3333333333333333 * N[Power[im$95$m, 3.0], $MachinePrecision]), $MachinePrecision] + N[(-0.016666666666666666 * N[Power[im$95$m, 5.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)) < -0.20000000000000001

   1. Initial program 100.0%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   if -0.20000000000000001 < (-.f64 (exp.f64 (neg.f64 im)) (exp.f64 im))

   1. Initial program 54.1%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   2. Taylor expanded in im around 0 92.9%

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

4. Final simplification 94.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{-im} - e^{im} \leq -0.2:\\ \;\;\;\;\left(e^{-im} - e^{im}\right) \cdot \left(0.5 \cdot \sin re\right)\\ \mathbf{else}:\\ \;\;\;\;\left(0.5 \cdot \sin re\right) \cdot \left(im \cdot -2 + \left(-0.3333333333333333 \cdot {im}^{3} + -0.016666666666666666 \cdot {im}^{5}\right)\right)\\ \end{array} \]

Alternative 2: 99.9% 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.004:\\ \;\;\;\;t_0 \cdot \left(0.5 \cdot \sin re\right)\\ \mathbf{else}:\\ \;\;\;\;\sin re \cdot \left({im_m}^{3} \cdot -0.16666666666666666 - im_m\right)\\ \end{array} \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
im_s = (copysign.f64 1 im)
(FPCore (im_s re im_m)
 :precision binary64
 (let* ((t_0 (- (exp (- im_m)) (exp im_m))))
   (*
    im_s
    (if (<= t_0 -0.004)
      (* t_0 (* 0.5 (sin re)))
      (* (sin re) (- (* (pow im_m 3.0) -0.16666666666666666) im_m))))))

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.004) {
		tmp = t_0 * (0.5 * sin(re));
	} else {
		tmp = sin(re) * ((pow(im_m, 3.0) * -0.16666666666666666) - 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) :: t_0
    real(8) :: tmp
    t_0 = exp(-im_m) - exp(im_m)
    if (t_0 <= (-0.004d0)) then
        tmp = t_0 * (0.5d0 * sin(re))
    else
        tmp = sin(re) * (((im_m ** 3.0d0) * (-0.16666666666666666d0)) - 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 t_0 = Math.exp(-im_m) - Math.exp(im_m);
	double tmp;
	if (t_0 <= -0.004) {
		tmp = t_0 * (0.5 * Math.sin(re));
	} else {
		tmp = Math.sin(re) * ((Math.pow(im_m, 3.0) * -0.16666666666666666) - 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):
	t_0 = math.exp(-im_m) - math.exp(im_m)
	tmp = 0
	if t_0 <= -0.004:
		tmp = t_0 * (0.5 * math.sin(re))
	else:
		tmp = math.sin(re) * ((math.pow(im_m, 3.0) * -0.16666666666666666) - im_m)
	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.004)
		tmp = Float64(t_0 * Float64(0.5 * sin(re)));
	else
		tmp = Float64(sin(re) * Float64(Float64((im_m ^ 3.0) * -0.16666666666666666) - 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)
	t_0 = exp(-im_m) - exp(im_m);
	tmp = 0.0;
	if (t_0 <= -0.004)
		tmp = t_0 * (0.5 * sin(re));
	else
		tmp = sin(re) * (((im_m ^ 3.0) * -0.16666666666666666) - 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_] := 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.004], N[(t$95$0 * N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sin[re], $MachinePrecision] * N[(N[(N[Power[im$95$m, 3.0], $MachinePrecision] * -0.16666666666666666), $MachinePrecision] - im$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)) < -0.0040000000000000001

   1. Initial program 99.7%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   if -0.0040000000000000001 < (-.f64 (exp.f64 (neg.f64 im)) (exp.f64 im))

   1. Initial program 53.7%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   2. Taylor expanded in im around 0 92.8%

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

   3. Taylor expanded in im around 0 89.8%

      \[\leadsto \color{blue}{-1 \cdot \left(im \cdot \sin re\right) + -0.16666666666666666 \cdot \left({im}^{3} \cdot \sin re\right)} \]
   4. Step-by-step derivation

      1. +-commutative 89.8%

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

      2. mul-1-neg 89.8%

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

      3. unsub-neg 89.8%

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

      4. associate-*r* 89.8%

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

      5. distribute-rgt-out-- 89.8%

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

      6. *-commutative 89.8%

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

   5. Simplified 89.8%

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

4. Final simplification 92.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{-im} - e^{im} \leq -0.004:\\ \;\;\;\;\left(e^{-im} - e^{im}\right) \cdot \left(0.5 \cdot \sin re\right)\\ \mathbf{else}:\\ \;\;\;\;\sin re \cdot \left({im}^{3} \cdot -0.16666666666666666 - im\right)\\ \end{array} \]

Alternative 3: 97.0% 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 125:\\ \;\;\;\;\sin re \cdot \left({im_m}^{3} \cdot -0.16666666666666666 - im_m\right)\\ \mathbf{elif}\;im_m \leq 4.4 \cdot 10^{+61}:\\ \;\;\;\;\left(e^{-im_m} - e^{im_m}\right) \cdot \left(0.5 \cdot re\right)\\ \mathbf{else}:\\ \;\;\;\;-0.008333333333333333 \cdot \left(\sin re \cdot {im_m}^{5}\right)\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
im_s = (copysign.f64 1 im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= im_m 125.0)
    (* (sin re) (- (* (pow im_m 3.0) -0.16666666666666666) im_m))
    (if (<= im_m 4.4e+61)
      (* (- (exp (- im_m)) (exp im_m)) (* 0.5 re))
      (* -0.008333333333333333 (* (sin re) (pow 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 <= 125.0) {
		tmp = sin(re) * ((pow(im_m, 3.0) * -0.16666666666666666) - im_m);
	} else if (im_m <= 4.4e+61) {
		tmp = (exp(-im_m) - exp(im_m)) * (0.5 * re);
	} else {
		tmp = -0.008333333333333333 * (sin(re) * pow(im_m, 5.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 <= 125.0d0) then
        tmp = sin(re) * (((im_m ** 3.0d0) * (-0.16666666666666666d0)) - im_m)
    else if (im_m <= 4.4d+61) then
        tmp = (exp(-im_m) - exp(im_m)) * (0.5d0 * re)
    else
        tmp = (-0.008333333333333333d0) * (sin(re) * (im_m ** 5.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 <= 125.0) {
		tmp = Math.sin(re) * ((Math.pow(im_m, 3.0) * -0.16666666666666666) - im_m);
	} else if (im_m <= 4.4e+61) {
		tmp = (Math.exp(-im_m) - Math.exp(im_m)) * (0.5 * re);
	} else {
		tmp = -0.008333333333333333 * (Math.sin(re) * Math.pow(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 <= 125.0:
		tmp = math.sin(re) * ((math.pow(im_m, 3.0) * -0.16666666666666666) - im_m)
	elif im_m <= 4.4e+61:
		tmp = (math.exp(-im_m) - math.exp(im_m)) * (0.5 * re)
	else:
		tmp = -0.008333333333333333 * (math.sin(re) * math.pow(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 <= 125.0)
		tmp = Float64(sin(re) * Float64(Float64((im_m ^ 3.0) * -0.16666666666666666) - im_m));
	elseif (im_m <= 4.4e+61)
		tmp = Float64(Float64(exp(Float64(-im_m)) - exp(im_m)) * Float64(0.5 * re));
	else
		tmp = Float64(-0.008333333333333333 * Float64(sin(re) * (im_m ^ 5.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 <= 125.0)
		tmp = sin(re) * (((im_m ^ 3.0) * -0.16666666666666666) - im_m);
	elseif (im_m <= 4.4e+61)
		tmp = (exp(-im_m) - exp(im_m)) * (0.5 * re);
	else
		tmp = -0.008333333333333333 * (sin(re) * (im_m ^ 5.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, 125.0], N[(N[Sin[re], $MachinePrecision] * N[(N[(N[Power[im$95$m, 3.0], $MachinePrecision] * -0.16666666666666666), $MachinePrecision] - im$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[im$95$m, 4.4e+61], N[(N[(N[Exp[(-im$95$m)], $MachinePrecision] - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision] * N[(0.5 * re), $MachinePrecision]), $MachinePrecision], N[(-0.008333333333333333 * N[(N[Sin[re], $MachinePrecision] * N[Power[im$95$m, 5.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if im < 125

   1. Initial program 54.3%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   2. Taylor expanded in im around 0 92.5%

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

   3. Taylor expanded in im around 0 89.3%

      \[\leadsto \color{blue}{-1 \cdot \left(im \cdot \sin re\right) + -0.16666666666666666 \cdot \left({im}^{3} \cdot \sin re\right)} \]
   4. Step-by-step derivation

      1. +-commutative 89.3%

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

      2. mul-1-neg 89.3%

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

      3. unsub-neg 89.3%

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

      4. associate-*r* 89.3%

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

      5. distribute-rgt-out-- 89.3%

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

      6. *-commutative 89.3%

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

   5. Simplified 89.3%

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

   if 125 < im < 4.4000000000000001e61

   1. Initial program 100.0%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   2. Taylor expanded in re around 0 91.7%

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

      1. associate-*r* 91.7%

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

      2. *-commutative 91.7%

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

   4. Simplified 91.7%

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

   if 4.4000000000000001e61 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   2. Taylor expanded in im around 0 100.0%

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

   3. Taylor expanded in im around inf 100.0%

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

4. Final simplification 91.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 125:\\ \;\;\;\;\sin re \cdot \left({im}^{3} \cdot -0.16666666666666666 - im\right)\\ \mathbf{elif}\;im \leq 4.4 \cdot 10^{+61}:\\ \;\;\;\;\left(e^{-im} - e^{im}\right) \cdot \left(0.5 \cdot re\right)\\ \mathbf{else}:\\ \;\;\;\;-0.008333333333333333 \cdot \left(\sin re \cdot {im}^{5}\right)\\ \end{array} \]

Alternative 4: 90.8% 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:\\ \;\;\;\;im_m \cdot \left(-\sin re\right)\\ \mathbf{elif}\;im_m \leq 1.42 \cdot 10^{+55}:\\ \;\;\;\;-0.008333333333333333 \cdot \left(re \cdot {im_m}^{5}\right)\\ \mathbf{else}:\\ \;\;\;\;-0.008333333333333333 \cdot \left(\sin re \cdot {im_m}^{5}\right)\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
im_s = (copysign.f64 1 im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= im_m 450.0)
    (* im_m (- (sin re)))
    (if (<= im_m 1.42e+55)
      (* -0.008333333333333333 (* re (pow im_m 5.0)))
      (* -0.008333333333333333 (* (sin re) (pow 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 * -sin(re);
	} else if (im_m <= 1.42e+55) {
		tmp = -0.008333333333333333 * (re * pow(im_m, 5.0));
	} else {
		tmp = -0.008333333333333333 * (sin(re) * pow(im_m, 5.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 <= 450.0d0) then
        tmp = im_m * -sin(re)
    else if (im_m <= 1.42d+55) then
        tmp = (-0.008333333333333333d0) * (re * (im_m ** 5.0d0))
    else
        tmp = (-0.008333333333333333d0) * (sin(re) * (im_m ** 5.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 <= 450.0) {
		tmp = im_m * -Math.sin(re);
	} else if (im_m <= 1.42e+55) {
		tmp = -0.008333333333333333 * (re * Math.pow(im_m, 5.0));
	} else {
		tmp = -0.008333333333333333 * (Math.sin(re) * Math.pow(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.sin(re)
	elif im_m <= 1.42e+55:
		tmp = -0.008333333333333333 * (re * math.pow(im_m, 5.0))
	else:
		tmp = -0.008333333333333333 * (math.sin(re) * math.pow(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(im_m * Float64(-sin(re)));
	elseif (im_m <= 1.42e+55)
		tmp = Float64(-0.008333333333333333 * Float64(re * (im_m ^ 5.0)));
	else
		tmp = Float64(-0.008333333333333333 * Float64(sin(re) * (im_m ^ 5.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 <= 450.0)
		tmp = im_m * -sin(re);
	elseif (im_m <= 1.42e+55)
		tmp = -0.008333333333333333 * (re * (im_m ^ 5.0));
	else
		tmp = -0.008333333333333333 * (sin(re) * (im_m ^ 5.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, 450.0], N[(im$95$m * (-N[Sin[re], $MachinePrecision])), $MachinePrecision], If[LessEqual[im$95$m, 1.42e+55], N[(-0.008333333333333333 * N[(re * N[Power[im$95$m, 5.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-0.008333333333333333 * N[(N[Sin[re], $MachinePrecision] * N[Power[im$95$m, 5.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if im < 450

   1. Initial program 54.3%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   2. Taylor expanded in im around 0 69.1%

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

      1. associate-*r* 69.1%

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

      2. neg-mul-1 69.1%

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

   4. Simplified 69.1%

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

   if 450 < im < 1.42000000000000005e55

   1. Initial program 100.0%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   2. Taylor expanded in im around 0 4.2%

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

   3. Taylor expanded in im around inf 4.2%

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

      1. *-commutative 4.2%

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

      2. associate-*l* 4.2%

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

   5. Simplified 4.2%

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

   6. Taylor expanded in re around 0 51.4%

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

   if 1.42000000000000005e55 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   2. Taylor expanded in im around 0 96.0%

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

   3. Taylor expanded in im around inf 96.0%

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

4. Final simplification 73.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 450:\\ \;\;\;\;im \cdot \left(-\sin re\right)\\ \mathbf{elif}\;im \leq 1.42 \cdot 10^{+55}:\\ \;\;\;\;-0.008333333333333333 \cdot \left(re \cdot {im}^{5}\right)\\ \mathbf{else}:\\ \;\;\;\;-0.008333333333333333 \cdot \left(\sin re \cdot {im}^{5}\right)\\ \end{array} \]

Alternative 5: 91.0% 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 4500:\\ \;\;\;\;\sin re \cdot \left({im_m}^{3} \cdot -0.16666666666666666 - im_m\right)\\ \mathbf{elif}\;im_m \leq 1.42 \cdot 10^{+55}:\\ \;\;\;\;-0.008333333333333333 \cdot \left(re \cdot {im_m}^{5}\right)\\ \mathbf{else}:\\ \;\;\;\;-0.008333333333333333 \cdot \left(\sin re \cdot {im_m}^{5}\right)\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
im_s = (copysign.f64 1 im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= im_m 4500.0)
    (* (sin re) (- (* (pow im_m 3.0) -0.16666666666666666) im_m))
    (if (<= im_m 1.42e+55)
      (* -0.008333333333333333 (* re (pow im_m 5.0)))
      (* -0.008333333333333333 (* (sin re) (pow 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 <= 4500.0) {
		tmp = sin(re) * ((pow(im_m, 3.0) * -0.16666666666666666) - im_m);
	} else if (im_m <= 1.42e+55) {
		tmp = -0.008333333333333333 * (re * pow(im_m, 5.0));
	} else {
		tmp = -0.008333333333333333 * (sin(re) * pow(im_m, 5.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 <= 4500.0d0) then
        tmp = sin(re) * (((im_m ** 3.0d0) * (-0.16666666666666666d0)) - im_m)
    else if (im_m <= 1.42d+55) then
        tmp = (-0.008333333333333333d0) * (re * (im_m ** 5.0d0))
    else
        tmp = (-0.008333333333333333d0) * (sin(re) * (im_m ** 5.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 <= 4500.0) {
		tmp = Math.sin(re) * ((Math.pow(im_m, 3.0) * -0.16666666666666666) - im_m);
	} else if (im_m <= 1.42e+55) {
		tmp = -0.008333333333333333 * (re * Math.pow(im_m, 5.0));
	} else {
		tmp = -0.008333333333333333 * (Math.sin(re) * Math.pow(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 <= 4500.0:
		tmp = math.sin(re) * ((math.pow(im_m, 3.0) * -0.16666666666666666) - im_m)
	elif im_m <= 1.42e+55:
		tmp = -0.008333333333333333 * (re * math.pow(im_m, 5.0))
	else:
		tmp = -0.008333333333333333 * (math.sin(re) * math.pow(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 <= 4500.0)
		tmp = Float64(sin(re) * Float64(Float64((im_m ^ 3.0) * -0.16666666666666666) - im_m));
	elseif (im_m <= 1.42e+55)
		tmp = Float64(-0.008333333333333333 * Float64(re * (im_m ^ 5.0)));
	else
		tmp = Float64(-0.008333333333333333 * Float64(sin(re) * (im_m ^ 5.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 <= 4500.0)
		tmp = sin(re) * (((im_m ^ 3.0) * -0.16666666666666666) - im_m);
	elseif (im_m <= 1.42e+55)
		tmp = -0.008333333333333333 * (re * (im_m ^ 5.0));
	else
		tmp = -0.008333333333333333 * (sin(re) * (im_m ^ 5.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, 4500.0], N[(N[Sin[re], $MachinePrecision] * N[(N[(N[Power[im$95$m, 3.0], $MachinePrecision] * -0.16666666666666666), $MachinePrecision] - im$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[im$95$m, 1.42e+55], N[(-0.008333333333333333 * N[(re * N[Power[im$95$m, 5.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-0.008333333333333333 * N[(N[Sin[re], $MachinePrecision] * N[Power[im$95$m, 5.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if im < 4500

   1. Initial program 54.3%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   2. Taylor expanded in im around 0 92.5%

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

   3. Taylor expanded in im around 0 89.3%

      \[\leadsto \color{blue}{-1 \cdot \left(im \cdot \sin re\right) + -0.16666666666666666 \cdot \left({im}^{3} \cdot \sin re\right)} \]
   4. Step-by-step derivation

      1. +-commutative 89.3%

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

      2. mul-1-neg 89.3%

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

      3. unsub-neg 89.3%

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

      4. associate-*r* 89.3%

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

      5. distribute-rgt-out-- 89.3%

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

      6. *-commutative 89.3%

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

   5. Simplified 89.3%

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

   if 4500 < im < 1.42000000000000005e55

   1. Initial program 100.0%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   2. Taylor expanded in im around 0 4.2%

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

   3. Taylor expanded in im around inf 4.2%

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

      1. *-commutative 4.2%

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

      2. associate-*l* 4.2%

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

   5. Simplified 4.2%

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

   6. Taylor expanded in re around 0 51.4%

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

   if 1.42000000000000005e55 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   2. Taylor expanded in im around 0 96.0%

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

   3. Taylor expanded in im around inf 96.0%

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

4. Final simplification 89.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 4500:\\ \;\;\;\;\sin re \cdot \left({im}^{3} \cdot -0.16666666666666666 - im\right)\\ \mathbf{elif}\;im \leq 1.42 \cdot 10^{+55}:\\ \;\;\;\;-0.008333333333333333 \cdot \left(re \cdot {im}^{5}\right)\\ \mathbf{else}:\\ \;\;\;\;-0.008333333333333333 \cdot \left(\sin re \cdot {im}^{5}\right)\\ \end{array} \]

Alternative 6: 77.4% accurate, 2.7× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ im_s = \mathsf{copysign}\left(1, im\right) \\ im_s \cdot \begin{array}{l} \mathbf{if}\;im_m \leq 420:\\ \;\;\;\;im_m \cdot \left(-\sin re\right)\\ \mathbf{elif}\;im_m \leq 2.8 \cdot 10^{+54} \lor \neg \left(im_m \leq 6.3 \cdot 10^{+105}\right):\\ \;\;\;\;-0.008333333333333333 \cdot \left(re \cdot {im_m}^{5}\right)\\ \mathbf{else}:\\ \;\;\;\;im_m \cdot \left({re}^{3} \cdot 0.16666666666666666 - re\right)\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
im_s = (copysign.f64 1 im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= im_m 420.0)
    (* im_m (- (sin re)))
    (if (or (<= im_m 2.8e+54) (not (<= im_m 6.3e+105)))
      (* -0.008333333333333333 (* re (pow im_m 5.0)))
      (* im_m (- (* (pow re 3.0) 0.16666666666666666) re))))))

C

im_m = fabs(im);
im_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 420.0) {
		tmp = im_m * -sin(re);
	} else if ((im_m <= 2.8e+54) || !(im_m <= 6.3e+105)) {
		tmp = -0.008333333333333333 * (re * pow(im_m, 5.0));
	} else {
		tmp = im_m * ((pow(re, 3.0) * 0.16666666666666666) - re);
	}
	return im_s * tmp;
}

Fortran

im_m = abs(im)
im_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (im_m <= 420.0d0) then
        tmp = im_m * -sin(re)
    else if ((im_m <= 2.8d+54) .or. (.not. (im_m <= 6.3d+105))) then
        tmp = (-0.008333333333333333d0) * (re * (im_m ** 5.0d0))
    else
        tmp = im_m * (((re ** 3.0d0) * 0.16666666666666666d0) - re)
    end if
    code = im_s * tmp
end function

Java

im_m = Math.abs(im);
im_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 420.0) {
		tmp = im_m * -Math.sin(re);
	} else if ((im_m <= 2.8e+54) || !(im_m <= 6.3e+105)) {
		tmp = -0.008333333333333333 * (re * Math.pow(im_m, 5.0));
	} else {
		tmp = im_m * ((Math.pow(re, 3.0) * 0.16666666666666666) - re);
	}
	return im_s * tmp;
}

Python

im_m = math.fabs(im)
im_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	tmp = 0
	if im_m <= 420.0:
		tmp = im_m * -math.sin(re)
	elif (im_m <= 2.8e+54) or not (im_m <= 6.3e+105):
		tmp = -0.008333333333333333 * (re * math.pow(im_m, 5.0))
	else:
		tmp = im_m * ((math.pow(re, 3.0) * 0.16666666666666666) - re)
	return im_s * tmp

Julia

im_m = abs(im)
im_s = copysign(1.0, im)
function code(im_s, re, im_m)
	tmp = 0.0
	if (im_m <= 420.0)
		tmp = Float64(im_m * Float64(-sin(re)));
	elseif ((im_m <= 2.8e+54) || !(im_m <= 6.3e+105))
		tmp = Float64(-0.008333333333333333 * Float64(re * (im_m ^ 5.0)));
	else
		tmp = Float64(im_m * Float64(Float64((re ^ 3.0) * 0.16666666666666666) - re));
	end
	return Float64(im_s * tmp)
end

MATLAB

im_m = abs(im);
im_s = sign(im) * abs(1.0);
function tmp_2 = code(im_s, re, im_m)
	tmp = 0.0;
	if (im_m <= 420.0)
		tmp = im_m * -sin(re);
	elseif ((im_m <= 2.8e+54) || ~((im_m <= 6.3e+105)))
		tmp = -0.008333333333333333 * (re * (im_m ^ 5.0));
	else
		tmp = im_m * (((re ^ 3.0) * 0.16666666666666666) - re);
	end
	tmp_2 = im_s * tmp;
end

Wolfram

im_m = N[Abs[im], $MachinePrecision]
im_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[im$95$m, 420.0], N[(im$95$m * (-N[Sin[re], $MachinePrecision])), $MachinePrecision], If[Or[LessEqual[im$95$m, 2.8e+54], N[Not[LessEqual[im$95$m, 6.3e+105]], $MachinePrecision]], N[(-0.008333333333333333 * N[(re * N[Power[im$95$m, 5.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(im$95$m * N[(N[(N[Power[re, 3.0], $MachinePrecision] * 0.16666666666666666), $MachinePrecision] - re), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if im < 420

   1. Initial program 54.3%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   2. Taylor expanded in im around 0 69.1%

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

      1. associate-*r* 69.1%

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

      2. neg-mul-1 69.1%

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

   4. Simplified 69.1%

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

   if 420 < im < 2.80000000000000015e54 or 6.29999999999999953e105 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   2. Taylor expanded in im around 0 80.4%

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

   3. Taylor expanded in im around inf 80.4%

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

      1. *-commutative 80.4%

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

      2. associate-*l* 80.4%

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

   5. Simplified 80.4%

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

   6. Taylor expanded in re around 0 73.8%

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

   if 2.80000000000000015e54 < im < 6.29999999999999953e105

   1. Initial program 100.0%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   2. Taylor expanded in im around 0 3.4%

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

      1. associate-*r* 3.4%

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

      2. neg-mul-1 3.4%

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

   4. Simplified 3.4%

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

   5. Taylor expanded in re around 0 38.1%

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

      1. +-commutative 38.1%

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

      2. mul-1-neg 38.1%

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

      3. unsub-neg 38.1%

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

      4. *-commutative 38.1%

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

      5. associate-*l* 38.1%

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

      6. distribute-lft-out-- 63.1%

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

   7. Simplified 63.1%

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

4. Final simplification 69.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 420:\\ \;\;\;\;im \cdot \left(-\sin re\right)\\ \mathbf{elif}\;im \leq 2.8 \cdot 10^{+54} \lor \neg \left(im \leq 6.3 \cdot 10^{+105}\right):\\ \;\;\;\;-0.008333333333333333 \cdot \left(re \cdot {im}^{5}\right)\\ \mathbf{else}:\\ \;\;\;\;im \cdot \left({re}^{3} \cdot 0.16666666666666666 - re\right)\\ \end{array} \]

Alternative 7: 77.4% accurate, 2.7× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ im_s = \mathsf{copysign}\left(1, im\right) \\ im_s \cdot \begin{array}{l} \mathbf{if}\;im_m \leq 1400:\\ \;\;\;\;im_m \cdot \left(-\sin re\right)\\ \mathbf{elif}\;im_m \leq 1.2 \cdot 10^{+52}:\\ \;\;\;\;-0.008333333333333333 \cdot \left(re \cdot {im_m}^{5}\right)\\ \mathbf{elif}\;im_m \leq 6.3 \cdot 10^{+105}:\\ \;\;\;\;im_m \cdot \left({re}^{3} \cdot 0.16666666666666666 - re\right)\\ \mathbf{else}:\\ \;\;\;\;re \cdot \left({im_m}^{3} \cdot -0.16666666666666666 - im_m\right)\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
im_s = (copysign.f64 1 im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= im_m 1400.0)
    (* im_m (- (sin re)))
    (if (<= im_m 1.2e+52)
      (* -0.008333333333333333 (* re (pow im_m 5.0)))
      (if (<= im_m 6.3e+105)
        (* im_m (- (* (pow re 3.0) 0.16666666666666666) re))
        (* re (- (* (pow im_m 3.0) -0.16666666666666666) 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 <= 1400.0) {
		tmp = im_m * -sin(re);
	} else if (im_m <= 1.2e+52) {
		tmp = -0.008333333333333333 * (re * pow(im_m, 5.0));
	} else if (im_m <= 6.3e+105) {
		tmp = im_m * ((pow(re, 3.0) * 0.16666666666666666) - re);
	} else {
		tmp = re * ((pow(im_m, 3.0) * -0.16666666666666666) - 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 <= 1400.0d0) then
        tmp = im_m * -sin(re)
    else if (im_m <= 1.2d+52) then
        tmp = (-0.008333333333333333d0) * (re * (im_m ** 5.0d0))
    else if (im_m <= 6.3d+105) then
        tmp = im_m * (((re ** 3.0d0) * 0.16666666666666666d0) - re)
    else
        tmp = re * (((im_m ** 3.0d0) * (-0.16666666666666666d0)) - 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 <= 1400.0) {
		tmp = im_m * -Math.sin(re);
	} else if (im_m <= 1.2e+52) {
		tmp = -0.008333333333333333 * (re * Math.pow(im_m, 5.0));
	} else if (im_m <= 6.3e+105) {
		tmp = im_m * ((Math.pow(re, 3.0) * 0.16666666666666666) - re);
	} else {
		tmp = re * ((Math.pow(im_m, 3.0) * -0.16666666666666666) - 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 <= 1400.0:
		tmp = im_m * -math.sin(re)
	elif im_m <= 1.2e+52:
		tmp = -0.008333333333333333 * (re * math.pow(im_m, 5.0))
	elif im_m <= 6.3e+105:
		tmp = im_m * ((math.pow(re, 3.0) * 0.16666666666666666) - re)
	else:
		tmp = re * ((math.pow(im_m, 3.0) * -0.16666666666666666) - 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 <= 1400.0)
		tmp = Float64(im_m * Float64(-sin(re)));
	elseif (im_m <= 1.2e+52)
		tmp = Float64(-0.008333333333333333 * Float64(re * (im_m ^ 5.0)));
	elseif (im_m <= 6.3e+105)
		tmp = Float64(im_m * Float64(Float64((re ^ 3.0) * 0.16666666666666666) - re));
	else
		tmp = Float64(re * Float64(Float64((im_m ^ 3.0) * -0.16666666666666666) - 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 <= 1400.0)
		tmp = im_m * -sin(re);
	elseif (im_m <= 1.2e+52)
		tmp = -0.008333333333333333 * (re * (im_m ^ 5.0));
	elseif (im_m <= 6.3e+105)
		tmp = im_m * (((re ^ 3.0) * 0.16666666666666666) - re);
	else
		tmp = re * (((im_m ^ 3.0) * -0.16666666666666666) - 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, 1400.0], N[(im$95$m * (-N[Sin[re], $MachinePrecision])), $MachinePrecision], If[LessEqual[im$95$m, 1.2e+52], N[(-0.008333333333333333 * N[(re * N[Power[im$95$m, 5.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[im$95$m, 6.3e+105], N[(im$95$m * N[(N[(N[Power[re, 3.0], $MachinePrecision] * 0.16666666666666666), $MachinePrecision] - re), $MachinePrecision]), $MachinePrecision], N[(re * N[(N[(N[Power[im$95$m, 3.0], $MachinePrecision] * -0.16666666666666666), $MachinePrecision] - im$95$m), $MachinePrecision]), $MachinePrecision]]]]), $MachinePrecision]

Derivation

1. Split input into 4 regimes

2. if im < 1400

   1. Initial program 54.3%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   2. Taylor expanded in im around 0 69.1%

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

      1. associate-*r* 69.1%

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

      2. neg-mul-1 69.1%

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

   4. Simplified 69.1%

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

   if 1400 < im < 1.2e52

   1. Initial program 100.0%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   2. Taylor expanded in im around 0 4.2%

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

   3. Taylor expanded in im around inf 4.2%

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

      1. *-commutative 4.2%

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

      2. associate-*l* 4.2%

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

   5. Simplified 4.2%

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

   6. Taylor expanded in re around 0 51.4%

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

   if 1.2e52 < im < 6.29999999999999953e105

   1. Initial program 100.0%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   2. Taylor expanded in im around 0 3.4%

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

      1. associate-*r* 3.4%

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

      2. neg-mul-1 3.4%

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

   4. Simplified 3.4%

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

   5. Taylor expanded in re around 0 38.1%

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

      1. +-commutative 38.1%

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

      2. mul-1-neg 38.1%

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

      3. unsub-neg 38.1%

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

      4. *-commutative 38.1%

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

      5. associate-*l* 38.1%

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

      6. distribute-lft-out-- 63.1%

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

   7. Simplified 63.1%

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

   if 6.29999999999999953e105 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   2. Taylor expanded in re around 0 79.5%

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

      1. associate-*r* 79.5%

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

      2. *-commutative 79.5%

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

   4. Simplified 79.5%

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

   5. Taylor expanded in im around 0 79.5%

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

      1. +-commutative 79.5%

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

      2. mul-1-neg 79.5%

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

      3. unsub-neg 79.5%

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

      4. associate-*r* 79.5%

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

      5. distribute-rgt-out-- 79.5%

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

      6. *-commutative 79.5%

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

   7. Simplified 79.5%

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

4. Final simplification 69.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 1400:\\ \;\;\;\;im \cdot \left(-\sin re\right)\\ \mathbf{elif}\;im \leq 1.2 \cdot 10^{+52}:\\ \;\;\;\;-0.008333333333333333 \cdot \left(re \cdot {im}^{5}\right)\\ \mathbf{elif}\;im \leq 6.3 \cdot 10^{+105}:\\ \;\;\;\;im \cdot \left({re}^{3} \cdot 0.16666666666666666 - re\right)\\ \mathbf{else}:\\ \;\;\;\;re \cdot \left({im}^{3} \cdot -0.16666666666666666 - im\right)\\ \end{array} \]

Alternative 8: 77.3% accurate, 2.7× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ im_s = \mathsf{copysign}\left(1, im\right) \\ im_s \cdot \begin{array}{l} \mathbf{if}\;im_m \leq 10500:\\ \;\;\;\;im_m \cdot \left(-\sin re\right)\\ \mathbf{elif}\;im_m \leq 5.8 \cdot 10^{+53} \lor \neg \left(im_m \leq 6.3 \cdot 10^{+105}\right):\\ \;\;\;\;-0.008333333333333333 \cdot \left(re \cdot {im_m}^{5}\right)\\ \mathbf{else}:\\ \;\;\;\;{re}^{3} \cdot \left(im_m \cdot 0.16666666666666666\right)\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
im_s = (copysign.f64 1 im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= im_m 10500.0)
    (* im_m (- (sin re)))
    (if (or (<= im_m 5.8e+53) (not (<= im_m 6.3e+105)))
      (* -0.008333333333333333 (* re (pow im_m 5.0)))
      (* (pow re 3.0) (* im_m 0.16666666666666666))))))

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 <= 10500.0) {
		tmp = im_m * -sin(re);
	} else if ((im_m <= 5.8e+53) || !(im_m <= 6.3e+105)) {
		tmp = -0.008333333333333333 * (re * pow(im_m, 5.0));
	} else {
		tmp = pow(re, 3.0) * (im_m * 0.16666666666666666);
	}
	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 <= 10500.0d0) then
        tmp = im_m * -sin(re)
    else if ((im_m <= 5.8d+53) .or. (.not. (im_m <= 6.3d+105))) then
        tmp = (-0.008333333333333333d0) * (re * (im_m ** 5.0d0))
    else
        tmp = (re ** 3.0d0) * (im_m * 0.16666666666666666d0)
    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 <= 10500.0) {
		tmp = im_m * -Math.sin(re);
	} else if ((im_m <= 5.8e+53) || !(im_m <= 6.3e+105)) {
		tmp = -0.008333333333333333 * (re * Math.pow(im_m, 5.0));
	} else {
		tmp = Math.pow(re, 3.0) * (im_m * 0.16666666666666666);
	}
	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 <= 10500.0:
		tmp = im_m * -math.sin(re)
	elif (im_m <= 5.8e+53) or not (im_m <= 6.3e+105):
		tmp = -0.008333333333333333 * (re * math.pow(im_m, 5.0))
	else:
		tmp = math.pow(re, 3.0) * (im_m * 0.16666666666666666)
	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 <= 10500.0)
		tmp = Float64(im_m * Float64(-sin(re)));
	elseif ((im_m <= 5.8e+53) || !(im_m <= 6.3e+105))
		tmp = Float64(-0.008333333333333333 * Float64(re * (im_m ^ 5.0)));
	else
		tmp = Float64((re ^ 3.0) * Float64(im_m * 0.16666666666666666));
	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 <= 10500.0)
		tmp = im_m * -sin(re);
	elseif ((im_m <= 5.8e+53) || ~((im_m <= 6.3e+105)))
		tmp = -0.008333333333333333 * (re * (im_m ^ 5.0));
	else
		tmp = (re ^ 3.0) * (im_m * 0.16666666666666666);
	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, 10500.0], N[(im$95$m * (-N[Sin[re], $MachinePrecision])), $MachinePrecision], If[Or[LessEqual[im$95$m, 5.8e+53], N[Not[LessEqual[im$95$m, 6.3e+105]], $MachinePrecision]], N[(-0.008333333333333333 * N[(re * N[Power[im$95$m, 5.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Power[re, 3.0], $MachinePrecision] * N[(im$95$m * 0.16666666666666666), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if im < 10500

   1. Initial program 54.3%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   2. Taylor expanded in im around 0 69.1%

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

      1. associate-*r* 69.1%

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

      2. neg-mul-1 69.1%

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

   4. Simplified 69.1%

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

   if 10500 < im < 5.8000000000000004e53 or 6.29999999999999953e105 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   2. Taylor expanded in im around 0 80.4%

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

   3. Taylor expanded in im around inf 80.4%

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

      1. *-commutative 80.4%

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

      2. associate-*l* 80.4%

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

   5. Simplified 80.4%

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

   6. Taylor expanded in re around 0 73.8%

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

   if 5.8000000000000004e53 < im < 6.29999999999999953e105

   1. Initial program 100.0%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   2. Taylor expanded in im around 0 3.4%

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

      1. associate-*r* 3.4%

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

      2. neg-mul-1 3.4%

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

   4. Simplified 3.4%

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

   5. Taylor expanded in re around 0 38.1%

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

      1. +-commutative 38.1%

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

      2. mul-1-neg 38.1%

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

      3. unsub-neg 38.1%

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

      4. *-commutative 38.1%

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

      5. associate-*l* 38.1%

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

      6. distribute-lft-out-- 63.1%

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

   7. Simplified 63.1%

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

   8. Taylor expanded in re around inf 62.9%

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

      1. *-commutative 62.9%

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

      2. *-commutative 62.9%

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

      3. associate-*l* 62.9%

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

   10. Simplified 62.9%

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

4. Final simplification 69.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 10500:\\ \;\;\;\;im \cdot \left(-\sin re\right)\\ \mathbf{elif}\;im \leq 5.8 \cdot 10^{+53} \lor \neg \left(im \leq 6.3 \cdot 10^{+105}\right):\\ \;\;\;\;-0.008333333333333333 \cdot \left(re \cdot {im}^{5}\right)\\ \mathbf{else}:\\ \;\;\;\;{re}^{3} \cdot \left(im \cdot 0.16666666666666666\right)\\ \end{array} \]

Alternative 9: 81.3% accurate, 2.9× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ im_s = \mathsf{copysign}\left(1, im\right) \\ im_s \cdot \begin{array}{l} \mathbf{if}\;im_m \leq 1100:\\ \;\;\;\;im_m \cdot \left(-\sin re\right)\\ \mathbf{else}:\\ \;\;\;\;-0.008333333333333333 \cdot \left(re \cdot {im_m}^{5}\right)\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
im_s = (copysign.f64 1 im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= im_m 1100.0)
    (* im_m (- (sin re)))
    (* -0.008333333333333333 (* re (pow 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 <= 1100.0) {
		tmp = im_m * -sin(re);
	} else {
		tmp = -0.008333333333333333 * (re * pow(im_m, 5.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 <= 1100.0d0) then
        tmp = im_m * -sin(re)
    else
        tmp = (-0.008333333333333333d0) * (re * (im_m ** 5.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 <= 1100.0) {
		tmp = im_m * -Math.sin(re);
	} else {
		tmp = -0.008333333333333333 * (re * Math.pow(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 <= 1100.0:
		tmp = im_m * -math.sin(re)
	else:
		tmp = -0.008333333333333333 * (re * math.pow(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 <= 1100.0)
		tmp = Float64(im_m * Float64(-sin(re)));
	else
		tmp = Float64(-0.008333333333333333 * Float64(re * (im_m ^ 5.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 <= 1100.0)
		tmp = im_m * -sin(re);
	else
		tmp = -0.008333333333333333 * (re * (im_m ^ 5.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, 1100.0], N[(im$95$m * (-N[Sin[re], $MachinePrecision])), $MachinePrecision], N[(-0.008333333333333333 * N[(re * N[Power[im$95$m, 5.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if im < 1100

   1. Initial program 54.3%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   2. Taylor expanded in im around 0 69.1%

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

      1. associate-*r* 69.1%

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

      2. neg-mul-1 69.1%

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

   4. Simplified 69.1%

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

   if 1100 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   2. Taylor expanded in im around 0 79.9%

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

   3. Taylor expanded in im around inf 79.9%

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

      1. *-commutative 79.9%

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

      2. associate-*l* 79.9%

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

   5. Simplified 79.9%

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

   6. Taylor expanded in re around 0 67.0%

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

4. Final simplification 68.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 1100:\\ \;\;\;\;im \cdot \left(-\sin re\right)\\ \mathbf{else}:\\ \;\;\;\;-0.008333333333333333 \cdot \left(re \cdot {im}^{5}\right)\\ \end{array} \]

Alternative 10: 56.7% accurate, 2.9× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ im_s = \mathsf{copysign}\left(1, im\right) \\ im_s \cdot \begin{array}{l} \mathbf{if}\;im_m \leq 1.15 \cdot 10^{+18}:\\ \;\;\;\;im_m \cdot \left(-\sin re\right)\\ \mathbf{else}:\\ \;\;\;\;im_m \cdot \left(-re\right)\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
im_s = (copysign.f64 1 im)
(FPCore (im_s re im_m)
 :precision binary64
 (* im_s (if (<= im_m 1.15e+18) (* im_m (- (sin re))) (* im_m (- re)))))

C

im_m = fabs(im);
im_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 1.15e+18) {
		tmp = im_m * -sin(re);
	} else {
		tmp = im_m * -re;
	}
	return im_s * tmp;
}

Fortran

im_m = abs(im)
im_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (im_m <= 1.15d+18) then
        tmp = im_m * -sin(re)
    else
        tmp = im_m * -re
    end if
    code = im_s * tmp
end function

Java

im_m = Math.abs(im);
im_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 1.15e+18) {
		tmp = im_m * -Math.sin(re);
	} else {
		tmp = im_m * -re;
	}
	return im_s * tmp;
}

Python

im_m = math.fabs(im)
im_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	tmp = 0
	if im_m <= 1.15e+18:
		tmp = im_m * -math.sin(re)
	else:
		tmp = im_m * -re
	return im_s * tmp

Julia

im_m = abs(im)
im_s = copysign(1.0, im)
function code(im_s, re, im_m)
	tmp = 0.0
	if (im_m <= 1.15e+18)
		tmp = Float64(im_m * Float64(-sin(re)));
	else
		tmp = Float64(im_m * Float64(-re));
	end
	return Float64(im_s * tmp)
end

MATLAB

im_m = abs(im);
im_s = sign(im) * abs(1.0);
function tmp_2 = code(im_s, re, im_m)
	tmp = 0.0;
	if (im_m <= 1.15e+18)
		tmp = im_m * -sin(re);
	else
		tmp = im_m * -re;
	end
	tmp_2 = im_s * tmp;
end

Wolfram

im_m = N[Abs[im], $MachinePrecision]
im_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[im$95$m, 1.15e+18], N[(im$95$m * (-N[Sin[re], $MachinePrecision])), $MachinePrecision], N[(im$95$m * (-re)), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if im < 1.15e18

   1. Initial program 54.8%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   2. Taylor expanded in im around 0 68.4%

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

      1. associate-*r* 68.4%

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

      2. neg-mul-1 68.4%

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

   4. Simplified 68.4%

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

   if 1.15e18 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

   2. Taylor expanded in im around 0 4.6%

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

      1. associate-*r* 4.6%

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

      2. neg-mul-1 4.6%

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

   4. Simplified 4.6%

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

   5. Taylor expanded in re around 0 20.8%

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

      1. associate-*r* 20.8%

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

      2. neg-mul-1 20.8%

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

   7. Simplified 20.8%

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

4. Final simplification 58.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 1.15 \cdot 10^{+18}:\\ \;\;\;\;im \cdot \left(-\sin re\right)\\ \mathbf{else}:\\ \;\;\;\;im \cdot \left(-re\right)\\ \end{array} \]

Alternative 11: 33.2% accurate, 77.0× speedup

Math

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

FPCore

im_m = (fabs.f64 im)
im_s = (copysign.f64 1 im)
(FPCore (im_s re im_m) :precision binary64 (* im_s (* im_m (- 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 * -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 * -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 * -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 * -re)

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 * Float64(-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 * -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 * (-re)), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 64.5%

   \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

2. Taylor expanded in im around 0 54.7%

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

   1. associate-*r* 54.7%

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

   2. neg-mul-1 54.7%

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

4. Simplified 54.7%

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

5. Taylor expanded in re around 0 34.7%

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

   1. associate-*r* 34.7%

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

   2. neg-mul-1 34.7%

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

7. Simplified 34.7%

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

8. Final simplification 34.7%

   \[\leadsto im \cdot \left(-re\right) \]

Alternative 12: 2.7% accurate, 308.0× speedup

Math

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

FPCore

im_m = (fabs.f64 im)
im_s = (copysign.f64 1 im)
(FPCore (im_s re im_m) :precision binary64 (* im_s -8.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 * -8.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 * (-8.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 * -8.0;
}

Python

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

Julia

im_m = abs(im)
im_s = copysign(1.0, im)
function code(im_s, re, im_m)
	return Float64(im_s * -8.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 * -8.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 * -8.0), $MachinePrecision]

Derivation

1. Initial program 64.5%

   \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

2. Taylor expanded in im around 0 89.7%

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

4. Applied egg-rr 2.9%

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

5. Final simplification 2.9%

   \[\leadsto -8 \]

Alternative 13: 2.8% accurate, 308.0× speedup

Math

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

FPCore

im_m = (fabs.f64 im)
im_s = (copysign.f64 1 im)
(FPCore (im_s re im_m) :precision binary64 (* im_s -0.004629629629629629))

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.004629629629629629;
}

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.004629629629629629d0)
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.004629629629629629;
}

Python

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

Julia

im_m = abs(im)
im_s = copysign(1.0, im)
function code(im_s, re, im_m)
	return Float64(im_s * -0.004629629629629629)
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.004629629629629629;
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 * -0.004629629629629629), $MachinePrecision]

Derivation

1. Initial program 64.5%

   \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

2. Taylor expanded in im around 0 89.7%

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

4. Applied egg-rr 3.0%

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

5. Final simplification 3.0%

   \[\leadsto -0.004629629629629629 \]

Alternative 14: 2.8% accurate, 308.0× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ im_s = \mathsf{copysign}\left(1, im\right) \\ im_s \cdot -4.6296296296296296 \cdot 10^{-6} \end{array} \]

FPCore

im_m = (fabs.f64 im)
im_s = (copysign.f64 1 im)
(FPCore (im_s re im_m) :precision binary64 (* im_s -4.6296296296296296e-6))

C

im_m = fabs(im);
im_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	return im_s * -4.6296296296296296e-6;
}

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 * (-4.6296296296296296d-6)
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 * -4.6296296296296296e-6;
}

Python

im_m = math.fabs(im)
im_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	return im_s * -4.6296296296296296e-6

Julia

im_m = abs(im)
im_s = copysign(1.0, im)
function code(im_s, re, im_m)
	return Float64(im_s * -4.6296296296296296e-6)
end

MATLAB

im_m = abs(im);
im_s = sign(im) * abs(1.0);
function tmp = code(im_s, re, im_m)
	tmp = im_s * -4.6296296296296296e-6;
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 * -4.6296296296296296e-6), $MachinePrecision]

Derivation

1. Initial program 64.5%

   \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

2. Taylor expanded in im around 0 89.7%

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

4. Applied egg-rr 2.9%

   \[\leadsto \color{blue}{-4.6296296296296296 \cdot 10^{-6}} \]

5. Final simplification 2.9%

   \[\leadsto -4.6296296296296296 \cdot 10^{-6} \]

Alternative 15: 15.5% accurate, 308.0× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ im_s = \mathsf{copysign}\left(1, im\right) \\ im_s \cdot 0 \end{array} \]

FPCore

im_m = (fabs.f64 im)
im_s = (copysign.f64 1 im)
(FPCore (im_s re im_m) :precision binary64 (* im_s 0.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.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.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.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.0

Julia

im_m = abs(im)
im_s = copysign(1.0, im)
function code(im_s, re, im_m)
	return Float64(im_s * 0.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.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 * 0.0), $MachinePrecision]

Derivation

1. Initial program 64.5%

   \[\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} - e^{im}\right) \]

2. Taylor expanded in im around 0 89.7%

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

4. Applied egg-rr 17.0%

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

5. Final simplification 17.0%

   \[\leadsto 0 \]

Developer target: 99.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left|im\right| < 1:\\ \;\;\;\;-\sin 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 \sin re\right) \cdot \left(e^{-im} - e^{im}\right)\\ \end{array} \end{array} \]

FPCore

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

C

double code(double re, double im) {
	double tmp;
	if (fabs(im) < 1.0) {
		tmp = -(sin(re) * ((im + (((0.16666666666666666 * im) * im) * im)) + (((((0.008333333333333333 * im) * im) * im) * im) * im)));
	} else {
		tmp = (0.5 * sin(re)) * (exp(-im) - exp(im));
	}
	return tmp;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if (abs(im) < 1.0d0) then
        tmp = -(sin(re) * ((im + (((0.16666666666666666d0 * im) * im) * im)) + (((((0.008333333333333333d0 * im) * im) * im) * im) * im)))
    else
        tmp = (0.5d0 * sin(re)) * (exp(-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.sin(re) * ((im + (((0.16666666666666666 * im) * im) * im)) + (((((0.008333333333333333 * im) * im) * im) * im) * im)));
	} else {
		tmp = (0.5 * Math.sin(re)) * (Math.exp(-im) - Math.exp(im));
	}
	return tmp;
}

Python

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

Julia

function code(re, im)
	tmp = 0.0
	if (abs(im) < 1.0)
		tmp = Float64(-Float64(sin(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 * sin(re)) * Float64(exp(Float64(-im)) - exp(im)));
	end
	return tmp
end

MATLAB

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

Wolfram

code[re_, im_] := If[Less[N[Abs[im], $MachinePrecision], 1.0], (-N[(N[Sin[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[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] - N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Reproduce

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

  :herbie-target
  (if (< (fabs im) 1.0) (- (* (sin re) (+ (+ im (* (* (* 0.16666666666666666 im) im) im)) (* (* (* (* (* 0.008333333333333333 im) im) im) im) im)))) (* (* 0.5 (sin re)) (- (exp (- im)) (exp im))))

  (* (* 0.5 (sin re)) (- (exp (- im)) (exp im))))