math.cos on complex, imaginary part

Percentage Accurate: 65.6% → 99.9%

Time: 10.3s

Alternatives: 15

Speedup: 2.8×

• 49.4% 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: 65.6% 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.1:\\ \;\;\;\;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.1)
      (* 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.1) {
		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.1d0)) 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.1) {
		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.1:
		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.1)
		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.1)
		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.1], 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.10000000000000001

   1. Initial program 98.5%

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

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

   1. Initial program 54.2%

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

   3. Taylor expanded in im around 0 94.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. Recombined 2 regimes into one program.

4. Final simplification 95.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{-im} - e^{im} \leq -0.1:\\ \;\;\;\;\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} \]
5. Add Preprocessing

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.002:\\ \;\;\;\;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.002)
      (* 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.002) {
		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.002d0)) 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.002) {
		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.002:
		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.002)
		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.002)
		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.002], 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)) < -2e-3

   1. Initial program 98.3%

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

   if -2e-3 < (-.f64 (exp.f64 (neg.f64 im)) (exp.f64 im))

   1. Initial program 53.8%

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

   3. Taylor expanded in im around 0 91.6%

      \[\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. associate-*r* 91.6%

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

      2. neg-mul-1 91.6%

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

      3. associate-*r* 91.6%

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

      4. distribute-rgt-out 91.6%

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

      5. *-commutative 91.6%

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

   5. Simplified 91.6%

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

   6. Taylor expanded in re around inf 91.6%

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

4. Final simplification 93.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{-im} - e^{im} \leq -0.002:\\ \;\;\;\;\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} \]
5. Add Preprocessing

Alternative 3: 91.8% accurate, 1.4× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ im\_s \cdot \begin{array}{l} \mathbf{if}\;im\_m \leq 650:\\ \;\;\;\;\left(-im\_m\right) \cdot \sin re\\ \mathbf{elif}\;im\_m \leq 3.1 \cdot 10^{+55}:\\ \;\;\;\;im\_m \cdot \left(\sqrt{{re}^{6} \cdot 0.027777777777777776} - re\right)\\ \mathbf{else}:\\ \;\;\;\;\sin re \cdot \left({im\_m}^{5} \cdot -0.008333333333333333\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 650.0)
    (* (- im_m) (sin re))
    (if (<= im_m 3.1e+55)
      (* im_m (- (sqrt (* (pow re 6.0) 0.027777777777777776)) re))
      (* (sin re) (* (pow im_m 5.0) -0.008333333333333333))))))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 650.0) {
		tmp = -im_m * sin(re);
	} else if (im_m <= 3.1e+55) {
		tmp = im_m * (sqrt((pow(re, 6.0) * 0.027777777777777776)) - re);
	} else {
		tmp = sin(re) * (pow(im_m, 5.0) * -0.008333333333333333);
	}
	return im_s * tmp;
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (im_m <= 650.0d0) then
        tmp = -im_m * sin(re)
    else if (im_m <= 3.1d+55) then
        tmp = im_m * (sqrt(((re ** 6.0d0) * 0.027777777777777776d0)) - re)
    else
        tmp = sin(re) * ((im_m ** 5.0d0) * (-0.008333333333333333d0))
    end if
    code = im_s * tmp
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 650.0) {
		tmp = -im_m * Math.sin(re);
	} else if (im_m <= 3.1e+55) {
		tmp = im_m * (Math.sqrt((Math.pow(re, 6.0) * 0.027777777777777776)) - re);
	} else {
		tmp = Math.sin(re) * (Math.pow(im_m, 5.0) * -0.008333333333333333);
	}
	return im_s * tmp;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	tmp = 0
	if im_m <= 650.0:
		tmp = -im_m * math.sin(re)
	elif im_m <= 3.1e+55:
		tmp = im_m * (math.sqrt((math.pow(re, 6.0) * 0.027777777777777776)) - re)
	else:
		tmp = math.sin(re) * (math.pow(im_m, 5.0) * -0.008333333333333333)
	return im_s * tmp

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	tmp = 0.0
	if (im_m <= 650.0)
		tmp = Float64(Float64(-im_m) * sin(re));
	elseif (im_m <= 3.1e+55)
		tmp = Float64(im_m * Float64(sqrt(Float64((re ^ 6.0) * 0.027777777777777776)) - re));
	else
		tmp = Float64(sin(re) * Float64((im_m ^ 5.0) * -0.008333333333333333));
	end
	return Float64(im_s * tmp)
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp_2 = code(im_s, re, im_m)
	tmp = 0.0;
	if (im_m <= 650.0)
		tmp = -im_m * sin(re);
	elseif (im_m <= 3.1e+55)
		tmp = im_m * (sqrt(((re ^ 6.0) * 0.027777777777777776)) - re);
	else
		tmp = sin(re) * ((im_m ^ 5.0) * -0.008333333333333333);
	end
	tmp_2 = im_s * tmp;
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[im$95$m, 650.0], N[((-im$95$m) * N[Sin[re], $MachinePrecision]), $MachinePrecision], If[LessEqual[im$95$m, 3.1e+55], N[(im$95$m * N[(N[Sqrt[N[(N[Power[re, 6.0], $MachinePrecision] * 0.027777777777777776), $MachinePrecision]], $MachinePrecision] - re), $MachinePrecision]), $MachinePrecision], N[(N[Sin[re], $MachinePrecision] * N[(N[Power[im$95$m, 5.0], $MachinePrecision] * -0.008333333333333333), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if im < 650

   1. Initial program 54.2%

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

   3. Taylor expanded in im around 0 70.7%

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

      1. associate-*r* 70.7%

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

      2. neg-mul-1 70.7%

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

   5. Simplified 70.7%

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

   if 650 < im < 3.09999999999999994e55

   1. Initial program 91.7%

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

   3. Taylor expanded in im around 0 3.0%

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

      1. associate-*r* 3.0%

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

      2. neg-mul-1 3.0%

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

   5. Simplified 3.0%

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

   6. Taylor expanded in re around 0 12.0%

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

      1. +-commutative 12.0%

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

      2. mul-1-neg 12.0%

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

      3. unsub-neg 12.0%

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

      4. *-commutative 12.0%

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

      5. associate-*r* 12.0%

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

      6. *-commutative 12.0%

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

      7. distribute-rgt-out-- 21.1%

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

   8. Simplified 21.1%

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

      1. add-sqr-sqrt 20.2%

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

      2. sqrt-unprod 37.8%

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

      3. *-commutative 37.8%

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

      4. *-commutative 37.8%

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

      5. swap-sqr 37.8%

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

      6. pow-prod-up 37.8%

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

      7. metadata-eval 37.8%

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

      8. metadata-eval 37.8%

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

   10. Applied egg-rr 37.8%

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

   if 3.09999999999999994e55 < im

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0 98.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)} \]

   4. Taylor expanded in im around inf 98.2%

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

      1. associate-*r* 98.2%

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

      2. *-commutative 98.2%

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

   6. Simplified 98.2%

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

4. Final simplification 74.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 650:\\ \;\;\;\;\left(-im\right) \cdot \sin re\\ \mathbf{elif}\;im \leq 3.1 \cdot 10^{+55}:\\ \;\;\;\;im \cdot \left(\sqrt{{re}^{6} \cdot 0.027777777777777776} - re\right)\\ \mathbf{else}:\\ \;\;\;\;\sin re \cdot \left({im}^{5} \cdot -0.008333333333333333\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 91.8% accurate, 1.4× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ im\_s \cdot \begin{array}{l} \mathbf{if}\;im\_m \leq 5500000000:\\ \;\;\;\;\sin re \cdot \left({im\_m}^{3} \cdot -0.16666666666666666 - im\_m\right)\\ \mathbf{elif}\;im\_m \leq 3.5 \cdot 10^{+55}:\\ \;\;\;\;im\_m \cdot \left(\sqrt{{re}^{6} \cdot 0.027777777777777776} - re\right)\\ \mathbf{else}:\\ \;\;\;\;\sin re \cdot \left({im\_m}^{5} \cdot -0.008333333333333333\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 5500000000.0)
    (* (sin re) (- (* (pow im_m 3.0) -0.16666666666666666) im_m))
    (if (<= im_m 3.5e+55)
      (* im_m (- (sqrt (* (pow re 6.0) 0.027777777777777776)) re))
      (* (sin re) (* (pow im_m 5.0) -0.008333333333333333))))))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 5500000000.0) {
		tmp = sin(re) * ((pow(im_m, 3.0) * -0.16666666666666666) - im_m);
	} else if (im_m <= 3.5e+55) {
		tmp = im_m * (sqrt((pow(re, 6.0) * 0.027777777777777776)) - re);
	} else {
		tmp = sin(re) * (pow(im_m, 5.0) * -0.008333333333333333);
	}
	return im_s * tmp;
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (im_m <= 5500000000.0d0) then
        tmp = sin(re) * (((im_m ** 3.0d0) * (-0.16666666666666666d0)) - im_m)
    else if (im_m <= 3.5d+55) then
        tmp = im_m * (sqrt(((re ** 6.0d0) * 0.027777777777777776d0)) - re)
    else
        tmp = sin(re) * ((im_m ** 5.0d0) * (-0.008333333333333333d0))
    end if
    code = im_s * tmp
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 5500000000.0) {
		tmp = Math.sin(re) * ((Math.pow(im_m, 3.0) * -0.16666666666666666) - im_m);
	} else if (im_m <= 3.5e+55) {
		tmp = im_m * (Math.sqrt((Math.pow(re, 6.0) * 0.027777777777777776)) - re);
	} else {
		tmp = Math.sin(re) * (Math.pow(im_m, 5.0) * -0.008333333333333333);
	}
	return im_s * tmp;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	tmp = 0
	if im_m <= 5500000000.0:
		tmp = math.sin(re) * ((math.pow(im_m, 3.0) * -0.16666666666666666) - im_m)
	elif im_m <= 3.5e+55:
		tmp = im_m * (math.sqrt((math.pow(re, 6.0) * 0.027777777777777776)) - re)
	else:
		tmp = math.sin(re) * (math.pow(im_m, 5.0) * -0.008333333333333333)
	return im_s * tmp

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	tmp = 0.0
	if (im_m <= 5500000000.0)
		tmp = Float64(sin(re) * Float64(Float64((im_m ^ 3.0) * -0.16666666666666666) - im_m));
	elseif (im_m <= 3.5e+55)
		tmp = Float64(im_m * Float64(sqrt(Float64((re ^ 6.0) * 0.027777777777777776)) - re));
	else
		tmp = Float64(sin(re) * Float64((im_m ^ 5.0) * -0.008333333333333333));
	end
	return Float64(im_s * tmp)
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp_2 = code(im_s, re, im_m)
	tmp = 0.0;
	if (im_m <= 5500000000.0)
		tmp = sin(re) * (((im_m ^ 3.0) * -0.16666666666666666) - im_m);
	elseif (im_m <= 3.5e+55)
		tmp = im_m * (sqrt(((re ^ 6.0) * 0.027777777777777776)) - re);
	else
		tmp = sin(re) * ((im_m ^ 5.0) * -0.008333333333333333);
	end
	tmp_2 = im_s * tmp;
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[im$95$m, 5500000000.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, 3.5e+55], N[(im$95$m * N[(N[Sqrt[N[(N[Power[re, 6.0], $MachinePrecision] * 0.027777777777777776), $MachinePrecision]], $MachinePrecision] - re), $MachinePrecision]), $MachinePrecision], N[(N[Sin[re], $MachinePrecision] * N[(N[Power[im$95$m, 5.0], $MachinePrecision] * -0.008333333333333333), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if im < 5.5e9

   1. Initial program 54.0%

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

   3. Taylor expanded in im around 0 91.0%

      \[\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. associate-*r* 91.0%

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

      2. neg-mul-1 91.0%

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

      3. associate-*r* 91.0%

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

      4. distribute-rgt-out 91.0%

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

      5. *-commutative 91.0%

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

   5. Simplified 91.0%

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

   6. Taylor expanded in re around inf 91.0%

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

   if 5.5e9 < im < 3.5000000000000001e55

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0 3.1%

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

      1. associate-*r* 3.1%

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

      2. neg-mul-1 3.1%

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

   5. Simplified 3.1%

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

   6. Taylor expanded in re around 0 13.1%

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

      1. +-commutative 13.1%

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

      2. mul-1-neg 13.1%

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

      3. unsub-neg 13.1%

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

      4. *-commutative 13.1%

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

      5. associate-*r* 13.1%

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

      6. *-commutative 13.1%

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

      7. distribute-rgt-out-- 23.1%

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

   8. Simplified 23.1%

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

      1. add-sqr-sqrt 22.0%

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

      2. sqrt-unprod 41.5%

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

      3. *-commutative 41.5%

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

      4. *-commutative 41.5%

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

      5. swap-sqr 41.5%

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

      6. pow-prod-up 41.5%

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

      7. metadata-eval 41.5%

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

      8. metadata-eval 41.5%

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

   10. Applied egg-rr 41.5%

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

   if 3.5000000000000001e55 < im

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0 98.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)} \]

   4. Taylor expanded in im around inf 98.2%

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

      1. associate-*r* 98.2%

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

      2. *-commutative 98.2%

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

   6. Simplified 98.2%

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

4. Final simplification 90.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 5500000000:\\ \;\;\;\;\sin re \cdot \left({im}^{3} \cdot -0.16666666666666666 - im\right)\\ \mathbf{elif}\;im \leq 3.5 \cdot 10^{+55}:\\ \;\;\;\;im \cdot \left(\sqrt{{re}^{6} \cdot 0.027777777777777776} - re\right)\\ \mathbf{else}:\\ \;\;\;\;\sin re \cdot \left({im}^{5} \cdot -0.008333333333333333\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 96.5% accurate, 1.4× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ im\_s \cdot \begin{array}{l} \mathbf{if}\;im\_m \leq 0.09:\\ \;\;\;\;\sin re \cdot \left({im\_m}^{3} \cdot -0.16666666666666666 - im\_m\right)\\ \mathbf{elif}\;im\_m \leq 1.28 \cdot 10^{+57}:\\ \;\;\;\;\left(e^{-im\_m} - e^{im\_m}\right) \cdot \left(0.5 \cdot re\right)\\ \mathbf{else}:\\ \;\;\;\;\sin re \cdot \left({im\_m}^{5} \cdot -0.008333333333333333\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 0.09)
    (* (sin re) (- (* (pow im_m 3.0) -0.16666666666666666) im_m))
    (if (<= im_m 1.28e+57)
      (* (- (exp (- im_m)) (exp im_m)) (* 0.5 re))
      (* (sin re) (* (pow im_m 5.0) -0.008333333333333333))))))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 0.09) {
		tmp = sin(re) * ((pow(im_m, 3.0) * -0.16666666666666666) - im_m);
	} else if (im_m <= 1.28e+57) {
		tmp = (exp(-im_m) - exp(im_m)) * (0.5 * re);
	} else {
		tmp = sin(re) * (pow(im_m, 5.0) * -0.008333333333333333);
	}
	return im_s * tmp;
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (im_m <= 0.09d0) then
        tmp = sin(re) * (((im_m ** 3.0d0) * (-0.16666666666666666d0)) - im_m)
    else if (im_m <= 1.28d+57) then
        tmp = (exp(-im_m) - exp(im_m)) * (0.5d0 * re)
    else
        tmp = sin(re) * ((im_m ** 5.0d0) * (-0.008333333333333333d0))
    end if
    code = im_s * tmp
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 0.09) {
		tmp = Math.sin(re) * ((Math.pow(im_m, 3.0) * -0.16666666666666666) - im_m);
	} else if (im_m <= 1.28e+57) {
		tmp = (Math.exp(-im_m) - Math.exp(im_m)) * (0.5 * re);
	} else {
		tmp = Math.sin(re) * (Math.pow(im_m, 5.0) * -0.008333333333333333);
	}
	return im_s * tmp;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	tmp = 0
	if im_m <= 0.09:
		tmp = math.sin(re) * ((math.pow(im_m, 3.0) * -0.16666666666666666) - im_m)
	elif im_m <= 1.28e+57:
		tmp = (math.exp(-im_m) - math.exp(im_m)) * (0.5 * re)
	else:
		tmp = math.sin(re) * (math.pow(im_m, 5.0) * -0.008333333333333333)
	return im_s * tmp

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	tmp = 0.0
	if (im_m <= 0.09)
		tmp = Float64(sin(re) * Float64(Float64((im_m ^ 3.0) * -0.16666666666666666) - im_m));
	elseif (im_m <= 1.28e+57)
		tmp = Float64(Float64(exp(Float64(-im_m)) - exp(im_m)) * Float64(0.5 * re));
	else
		tmp = Float64(sin(re) * Float64((im_m ^ 5.0) * -0.008333333333333333));
	end
	return Float64(im_s * tmp)
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp_2 = code(im_s, re, im_m)
	tmp = 0.0;
	if (im_m <= 0.09)
		tmp = sin(re) * (((im_m ^ 3.0) * -0.16666666666666666) - im_m);
	elseif (im_m <= 1.28e+57)
		tmp = (exp(-im_m) - exp(im_m)) * (0.5 * re);
	else
		tmp = sin(re) * ((im_m ^ 5.0) * -0.008333333333333333);
	end
	tmp_2 = im_s * tmp;
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[im$95$m, 0.09], 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.28e+57], N[(N[(N[Exp[(-im$95$m)], $MachinePrecision] - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision] * N[(0.5 * re), $MachinePrecision]), $MachinePrecision], N[(N[Sin[re], $MachinePrecision] * N[(N[Power[im$95$m, 5.0], $MachinePrecision] * -0.008333333333333333), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if im < 0.089999999999999997

   1. Initial program 54.2%

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

   3. Taylor expanded in im around 0 91.5%

      \[\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. associate-*r* 91.5%

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

      2. neg-mul-1 91.5%

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

      3. associate-*r* 91.5%

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

      4. distribute-rgt-out 91.5%

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

      5. *-commutative 91.5%

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

   5. Simplified 91.5%

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

   6. Taylor expanded in re around inf 91.5%

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

   if 0.089999999999999997 < im < 1.28000000000000001e57

   1. Initial program 92.4%

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

   3. Taylor expanded in re around 0 50.8%

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

      1. associate-*r* 50.8%

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

      2. *-commutative 50.8%

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

   5. Simplified 50.8%

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

   if 1.28000000000000001e57 < im

   1. Initial program 100.0%

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

   3. 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)} \]

   4. Taylor expanded in im around inf 100.0%

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

      1. associate-*r* 100.0%

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

      2. *-commutative 100.0%

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

   6. Simplified 100.0%

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

4. Final simplification 91.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 0.09:\\ \;\;\;\;\sin re \cdot \left({im}^{3} \cdot -0.16666666666666666 - im\right)\\ \mathbf{elif}\;im \leq 1.28 \cdot 10^{+57}:\\ \;\;\;\;\left(e^{-im} - e^{im}\right) \cdot \left(0.5 \cdot re\right)\\ \mathbf{else}:\\ \;\;\;\;\sin re \cdot \left({im}^{5} \cdot -0.008333333333333333\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 90.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 3.3:\\ \;\;\;\;\left(-im\_m\right) \cdot \sin re\\ \mathbf{else}:\\ \;\;\;\;\sin re \cdot \left({im\_m}^{5} \cdot -0.008333333333333333\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 3.3)
    (* (- im_m) (sin re))
    (* (sin re) (* (pow im_m 5.0) -0.008333333333333333)))))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 3.3) {
		tmp = -im_m * sin(re);
	} else {
		tmp = sin(re) * (pow(im_m, 5.0) * -0.008333333333333333);
	}
	return im_s * tmp;
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (im_m <= 3.3d0) then
        tmp = -im_m * sin(re)
    else
        tmp = sin(re) * ((im_m ** 5.0d0) * (-0.008333333333333333d0))
    end if
    code = im_s * tmp
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 3.3) {
		tmp = -im_m * Math.sin(re);
	} else {
		tmp = Math.sin(re) * (Math.pow(im_m, 5.0) * -0.008333333333333333);
	}
	return im_s * tmp;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	tmp = 0
	if im_m <= 3.3:
		tmp = -im_m * math.sin(re)
	else:
		tmp = math.sin(re) * (math.pow(im_m, 5.0) * -0.008333333333333333)
	return im_s * tmp

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	tmp = 0.0
	if (im_m <= 3.3)
		tmp = Float64(Float64(-im_m) * sin(re));
	else
		tmp = Float64(sin(re) * Float64((im_m ^ 5.0) * -0.008333333333333333));
	end
	return Float64(im_s * tmp)
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp_2 = code(im_s, re, im_m)
	tmp = 0.0;
	if (im_m <= 3.3)
		tmp = -im_m * sin(re);
	else
		tmp = sin(re) * ((im_m ^ 5.0) * -0.008333333333333333);
	end
	tmp_2 = im_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if im < 3.2999999999999998

   1. Initial program 54.2%

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

   3. Taylor expanded in im around 0 70.7%

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

      1. associate-*r* 70.7%

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

      2. neg-mul-1 70.7%

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

   5. Simplified 70.7%

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

   if 3.2999999999999998 < im

   1. Initial program 98.5%

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

   3. Taylor expanded in im around 0 81.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)} \]

   4. Taylor expanded in im around inf 81.5%

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

      1. associate-*r* 81.5%

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

      2. *-commutative 81.5%

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

   6. Simplified 81.5%

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

4. Final simplification 73.3%

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

Alternative 7: 58.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 5500000000:\\ \;\;\;\;\left(-im\_m\right) \cdot \sin re\\ \mathbf{elif}\;im\_m \leq 8 \cdot 10^{+112}:\\ \;\;\;\;im\_m \cdot \left(0.16666666666666666 \cdot {re}^{3}\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 5500000000.0)
    (* (- im_m) (sin re))
    (if (<= im_m 8e+112)
      (* im_m (* 0.16666666666666666 (pow re 3.0)))
      (* 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 <= 5500000000.0) {
		tmp = -im_m * sin(re);
	} else if (im_m <= 8e+112) {
		tmp = im_m * (0.16666666666666666 * pow(re, 3.0));
	} 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 <= 5500000000.0d0) then
        tmp = -im_m * sin(re)
    else if (im_m <= 8d+112) then
        tmp = im_m * (0.16666666666666666d0 * (re ** 3.0d0))
    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 <= 5500000000.0) {
		tmp = -im_m * Math.sin(re);
	} else if (im_m <= 8e+112) {
		tmp = im_m * (0.16666666666666666 * Math.pow(re, 3.0));
	} 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 <= 5500000000.0:
		tmp = -im_m * math.sin(re)
	elif im_m <= 8e+112:
		tmp = im_m * (0.16666666666666666 * math.pow(re, 3.0))
	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 <= 5500000000.0)
		tmp = Float64(Float64(-im_m) * sin(re));
	elseif (im_m <= 8e+112)
		tmp = Float64(im_m * Float64(0.16666666666666666 * (re ^ 3.0)));
	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 <= 5500000000.0)
		tmp = -im_m * sin(re);
	elseif (im_m <= 8e+112)
		tmp = im_m * (0.16666666666666666 * (re ^ 3.0));
	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, 5500000000.0], N[((-im$95$m) * N[Sin[re], $MachinePrecision]), $MachinePrecision], If[LessEqual[im$95$m, 8e+112], N[(im$95$m * N[(0.16666666666666666 * N[Power[re, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(im$95$m * (-re)), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if im < 5.5e9

   1. Initial program 54.0%

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

   3. Taylor expanded in im around 0 70.4%

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

      1. associate-*r* 70.4%

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

      2. neg-mul-1 70.4%

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

   5. Simplified 70.4%

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

   if 5.5e9 < im < 7.9999999999999994e112

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0 3.2%

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

      1. associate-*r* 3.2%

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

      2. neg-mul-1 3.2%

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

   5. Simplified 3.2%

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

   6. Taylor expanded in re around 0 13.9%

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

      1. +-commutative 13.9%

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

      2. mul-1-neg 13.9%

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

      3. unsub-neg 13.9%

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

      4. *-commutative 13.9%

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

      5. associate-*r* 13.9%

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

      6. *-commutative 13.9%

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

      7. distribute-rgt-out-- 25.9%

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

   8. Simplified 25.9%

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

   9. Taylor expanded in re around inf 25.5%

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

       1. *-commutative 25.5%

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

       2. associate-*l* 25.5%

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

       3. *-commutative 25.5%

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

   11. Simplified 25.5%

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

   if 7.9999999999999994e112 < im

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0 5.0%

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

      1. associate-*r* 5.0%

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

      2. neg-mul-1 5.0%

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

   5. Simplified 5.0%

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

   6. Taylor expanded in re around 0 22.3%

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

      1. associate-*r* 22.3%

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

      2. neg-mul-1 22.3%

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

   8. Simplified 22.3%

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

4. Final simplification 59.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 5500000000:\\ \;\;\;\;\left(-im\right) \cdot \sin re\\ \mathbf{elif}\;im \leq 8 \cdot 10^{+112}:\\ \;\;\;\;im \cdot \left(0.16666666666666666 \cdot {re}^{3}\right)\\ \mathbf{else}:\\ \;\;\;\;im \cdot \left(-re\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 81.4% 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 2.4 \cdot 10^{+26}:\\ \;\;\;\;\left(-im\_m\right) \cdot \sin re\\ \mathbf{else}:\\ \;\;\;\;re \cdot \left({im\_m}^{5} \cdot -0.008333333333333333\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 2.4e+26)
    (* (- im_m) (sin re))
    (* re (* (pow im_m 5.0) -0.008333333333333333)))))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 2.4e+26) {
		tmp = -im_m * sin(re);
	} else {
		tmp = re * (pow(im_m, 5.0) * -0.008333333333333333);
	}
	return im_s * tmp;
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (im_m <= 2.4d+26) then
        tmp = -im_m * sin(re)
    else
        tmp = re * ((im_m ** 5.0d0) * (-0.008333333333333333d0))
    end if
    code = im_s * tmp
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 2.4e+26) {
		tmp = -im_m * Math.sin(re);
	} else {
		tmp = re * (Math.pow(im_m, 5.0) * -0.008333333333333333);
	}
	return im_s * tmp;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	tmp = 0
	if im_m <= 2.4e+26:
		tmp = -im_m * math.sin(re)
	else:
		tmp = re * (math.pow(im_m, 5.0) * -0.008333333333333333)
	return im_s * tmp

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	tmp = 0.0
	if (im_m <= 2.4e+26)
		tmp = Float64(Float64(-im_m) * sin(re));
	else
		tmp = Float64(re * Float64((im_m ^ 5.0) * -0.008333333333333333));
	end
	return Float64(im_s * tmp)
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp_2 = code(im_s, re, im_m)
	tmp = 0.0;
	if (im_m <= 2.4e+26)
		tmp = -im_m * sin(re);
	else
		tmp = re * ((im_m ^ 5.0) * -0.008333333333333333);
	end
	tmp_2 = im_s * tmp;
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[im$95$m, 2.4e+26], N[((-im$95$m) * N[Sin[re], $MachinePrecision]), $MachinePrecision], N[(re * N[(N[Power[im$95$m, 5.0], $MachinePrecision] * -0.008333333333333333), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if im < 2.40000000000000005e26

   1. Initial program 55.1%

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

   3. Taylor expanded in im around 0 68.7%

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

      1. associate-*r* 68.7%

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

      2. neg-mul-1 68.7%

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

   5. Simplified 68.7%

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

   if 2.40000000000000005e26 < im

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0 89.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)} \]

   4. Taylor expanded in im around inf 89.8%

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

      1. associate-*r* 89.8%

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

      2. *-commutative 89.8%

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

   6. Simplified 89.8%

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

   7. Taylor expanded in re around 0 71.7%

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

      1. associate-*r* 71.7%

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

      2. *-commutative 71.7%

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

   9. Simplified 71.7%

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

4. Final simplification 69.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 2.4 \cdot 10^{+26}:\\ \;\;\;\;\left(-im\right) \cdot \sin re\\ \mathbf{else}:\\ \;\;\;\;re \cdot \left({im}^{5} \cdot -0.008333333333333333\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 81.4% 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 2.1 \cdot 10^{+26}:\\ \;\;\;\;\left(-im\_m\right) \cdot \sin re\\ \mathbf{else}:\\ \;\;\;\;{im\_m}^{5} \cdot \left(re \cdot -0.008333333333333333\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 2.1e+26)
    (* (- im_m) (sin re))
    (* (pow im_m 5.0) (* re -0.008333333333333333)))))

C

im\_m = fabs(im);
im\_s = copysign(1.0, im);
double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 2.1e+26) {
		tmp = -im_m * sin(re);
	} else {
		tmp = pow(im_m, 5.0) * (re * -0.008333333333333333);
	}
	return im_s * tmp;
}

Fortran

im\_m = abs(im)
im\_s = copysign(1.0d0, im)
real(8) function code(im_s, re, im_m)
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (im_m <= 2.1d+26) then
        tmp = -im_m * sin(re)
    else
        tmp = (im_m ** 5.0d0) * (re * (-0.008333333333333333d0))
    end if
    code = im_s * tmp
end function

Java

im\_m = Math.abs(im);
im\_s = Math.copySign(1.0, im);
public static double code(double im_s, double re, double im_m) {
	double tmp;
	if (im_m <= 2.1e+26) {
		tmp = -im_m * Math.sin(re);
	} else {
		tmp = Math.pow(im_m, 5.0) * (re * -0.008333333333333333);
	}
	return im_s * tmp;
}

Python

im\_m = math.fabs(im)
im\_s = math.copysign(1.0, im)
def code(im_s, re, im_m):
	tmp = 0
	if im_m <= 2.1e+26:
		tmp = -im_m * math.sin(re)
	else:
		tmp = math.pow(im_m, 5.0) * (re * -0.008333333333333333)
	return im_s * tmp

Julia

im\_m = abs(im)
im\_s = copysign(1.0, im)
function code(im_s, re, im_m)
	tmp = 0.0
	if (im_m <= 2.1e+26)
		tmp = Float64(Float64(-im_m) * sin(re));
	else
		tmp = Float64((im_m ^ 5.0) * Float64(re * -0.008333333333333333));
	end
	return Float64(im_s * tmp)
end

MATLAB

im\_m = abs(im);
im\_s = sign(im) * abs(1.0);
function tmp_2 = code(im_s, re, im_m)
	tmp = 0.0;
	if (im_m <= 2.1e+26)
		tmp = -im_m * sin(re);
	else
		tmp = (im_m ^ 5.0) * (re * -0.008333333333333333);
	end
	tmp_2 = im_s * tmp;
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := N[(im$95$s * If[LessEqual[im$95$m, 2.1e+26], N[((-im$95$m) * N[Sin[re], $MachinePrecision]), $MachinePrecision], N[(N[Power[im$95$m, 5.0], $MachinePrecision] * N[(re * -0.008333333333333333), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if im < 2.1000000000000001e26

   1. Initial program 55.1%

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

   3. Taylor expanded in im around 0 68.7%

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

      1. associate-*r* 68.7%

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

      2. neg-mul-1 68.7%

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

   5. Simplified 68.7%

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

   if 2.1000000000000001e26 < im

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0 89.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)} \]

   4. Taylor expanded in im around inf 89.8%

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

      1. associate-*r* 89.8%

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

      2. *-commutative 89.8%

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

   6. Simplified 89.8%

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

   7. Taylor expanded in re around 0 71.7%

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

      1. associate-*r* 71.7%

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

      2. *-commutative 71.7%

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

      3. associate-*l* 71.7%

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

   9. Simplified 71.7%

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

4. Final simplification 69.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 2.1 \cdot 10^{+26}:\\ \;\;\;\;\left(-im\right) \cdot \sin re\\ \mathbf{else}:\\ \;\;\;\;{im}^{5} \cdot \left(re \cdot -0.008333333333333333\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 55.7% 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 2.6 \cdot 10^{+117}:\\ \;\;\;\;\left(-im\_m\right) \cdot \sin re\\ \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 2.6e+117) (* (- 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 <= 2.6e+117) {
		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 <= 2.6d+117) 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 <= 2.6e+117) {
		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 <= 2.6e+117:
		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 <= 2.6e+117)
		tmp = Float64(Float64(-im_m) * 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 <= 2.6e+117)
		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, 2.6e+117], 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 < 2.5999999999999999e117

   1. Initial program 59.7%

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

   3. Taylor expanded in im around 0 61.9%

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

      1. associate-*r* 61.9%

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

      2. neg-mul-1 61.9%

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

   5. Simplified 61.9%

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

   if 2.5999999999999999e117 < im

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0 5.1%

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

      1. associate-*r* 5.1%

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

      2. neg-mul-1 5.1%

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

   5. Simplified 5.1%

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

   6. Taylor expanded in re around 0 23.9%

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

      1. associate-*r* 23.9%

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

      2. neg-mul-1 23.9%

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

   8. Simplified 23.9%

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

4. Final simplification 57.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 2.6 \cdot 10^{+117}:\\ \;\;\;\;\left(-im\right) \cdot \sin re\\ \mathbf{else}:\\ \;\;\;\;im \cdot \left(-re\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 32.7% 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.9%

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

3. Taylor expanded in im around 0 54.6%

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

   1. associate-*r* 54.6%

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

   2. neg-mul-1 54.6%

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

5. Simplified 54.6%

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

6. Taylor expanded in re around 0 35.8%

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

   1. associate-*r* 35.8%

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

   2. neg-mul-1 35.8%

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

8. Simplified 35.8%

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

9. Final simplification 35.8%

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

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

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

3. Taylor expanded in im around 0 54.6%

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

   1. associate-*r* 54.6%

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

   2. neg-mul-1 54.6%

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

5. Simplified 54.6%

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

7. Applied egg-rr 2.7%

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

8. Final simplification 2.7%

   \[\leadsto -8 \]
9. Add Preprocessing

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

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

3. Taylor expanded in im around 0 54.6%

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

   1. associate-*r* 54.6%

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

   2. neg-mul-1 54.6%

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

5. Simplified 54.6%

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

7. Applied egg-rr 2.8%

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

8. Final simplification 2.8%

   \[\leadsto -0.004629629629629629 \]
9. Add Preprocessing

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

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

3. Taylor expanded in im around 0 54.6%

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

   1. associate-*r* 54.6%

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

   2. neg-mul-1 54.6%

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

5. Simplified 54.6%

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

7. Applied egg-rr 2.8%

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

8. Final simplification 2.8%

   \[\leadsto -4.6296296296296296 \cdot 10^{-6} \]
9. Add Preprocessing

Alternative 15: 14.6% 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.9%

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

3. Taylor expanded in im around 0 54.6%

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

   1. associate-*r* 54.6%

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

   2. neg-mul-1 54.6%

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

5. Simplified 54.6%

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

7. Applied egg-rr 17.0%

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

8. Final simplification 17.0%

   \[\leadsto 0 \]
9. Add Preprocessing

Developer target: 99.8% accurate, 0.7× 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 2024053 
(FPCore (re im)
  :name "math.cos on complex, imaginary part"
  :precision binary64

  :alt
  (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))))