math.sin on complex, imaginary part

Percentage Accurate: 54.0% → 99.9%

Time: 10.4s

Alternatives: 19

Speedup: 2.5×

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

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(re, im)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = (0.5d0 * cos(re)) * (exp((0.0d0 - im)) - exp(im))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 54.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(re, im)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = (0.5d0 * cos(re)) * (exp((0.0d0 - im)) - exp(im))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if im < 7.20000000000000045e-4

   1. Initial program 41.4%

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

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. metadata-eval N/A

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

      4. fp-cancel-sub-sign-inv N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(\color{blue}{\mathsf{fma}\left(\frac{-1}{3}, {im}^{2}, -2\right)} \cdot im\right) \]

      8. unpow2 N/A

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

      9. lower-*.f64 84.4

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

   5. Applied rewrites 84.4%

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

   7. Applied rewrites 84.4%

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

   if 7.20000000000000045e-4 < im

   1. Initial program 100.0%

      \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{0 - im} - e^{im}\right) \]
   2. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 88.0%

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

Alternative 2: 98.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ \begin{array}{l} t_0 := 0.5 \cdot \cos re\\ t_1 := t\_0 \cdot \left(e^{-im\_m} - e^{im\_m}\right)\\ im\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+201}:\\ \;\;\;\;\left(\left(1 - im\_m\right) - e^{im\_m}\right) \cdot 0.5\\ \mathbf{elif}\;t\_1 \leq 10^{-5}:\\ \;\;\;\;t\_0 \cdot \mathsf{fma}\left(-0.3333333333333333 \cdot \left(im\_m \cdot im\_m\right), im\_m, -2 \cdot im\_m\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.001388888888888889, re \cdot re, 0.041666666666666664\right), re \cdot re, -0.5\right), re \cdot re, 1\right) \cdot \mathsf{fma}\left(im\_m \cdot im\_m, -0.16666666666666666, -1\right)\right) \cdot im\_m\\ \end{array} \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (let* ((t_0 (* 0.5 (cos re))) (t_1 (* t_0 (- (exp (- im_m)) (exp im_m)))))
   (*
    im_s
    (if (<= t_1 -5e+201)
      (* (- (- 1.0 im_m) (exp im_m)) 0.5)
      (if (<= t_1 1e-5)
        (* t_0 (fma (* -0.3333333333333333 (* im_m im_m)) im_m (* -2.0 im_m)))
        (*
         (*
          (fma
           (fma
            (fma -0.001388888888888889 (* re re) 0.041666666666666664)
            (* re re)
            -0.5)
           (* re re)
           1.0)
          (fma (* im_m im_m) -0.16666666666666666 -1.0))
         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 = 0.5 * cos(re);
	double t_1 = t_0 * (exp(-im_m) - exp(im_m));
	double tmp;
	if (t_1 <= -5e+201) {
		tmp = ((1.0 - im_m) - exp(im_m)) * 0.5;
	} else if (t_1 <= 1e-5) {
		tmp = t_0 * fma((-0.3333333333333333 * (im_m * im_m)), im_m, (-2.0 * im_m));
	} else {
		tmp = (fma(fma(fma(-0.001388888888888889, (re * re), 0.041666666666666664), (re * re), -0.5), (re * re), 1.0) * fma((im_m * im_m), -0.16666666666666666, -1.0)) * 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(0.5 * cos(re))
	t_1 = Float64(t_0 * Float64(exp(Float64(-im_m)) - exp(im_m)))
	tmp = 0.0
	if (t_1 <= -5e+201)
		tmp = Float64(Float64(Float64(1.0 - im_m) - exp(im_m)) * 0.5);
	elseif (t_1 <= 1e-5)
		tmp = Float64(t_0 * fma(Float64(-0.3333333333333333 * Float64(im_m * im_m)), im_m, Float64(-2.0 * im_m)));
	else
		tmp = Float64(Float64(fma(fma(fma(-0.001388888888888889, Float64(re * re), 0.041666666666666664), Float64(re * re), -0.5), Float64(re * re), 1.0) * fma(Float64(im_m * im_m), -0.16666666666666666, -1.0)) * im_m);
	end
	return Float64(im_s * tmp)
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -4.9999999999999995e201

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

      3. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \cdot \frac{1}{2} \]

      4. lower-exp.f64 N/A

         \[\leadsto \left(\color{blue}{e^{\mathsf{neg}\left(im\right)}} - e^{im}\right) \cdot \frac{1}{2} \]

      5. lower-neg.f64 N/A

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

      6. lower-exp.f64 70.1

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

   5. Applied rewrites 70.1%

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

   6. Taylor expanded in im around 0

      \[\leadsto \left(\left(1 + -1 \cdot im\right) - e^{im}\right) \cdot \frac{1}{2} \]
   7. Step-by-step derivation

   8. Applied rewrites 70.3%

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

   if -4.9999999999999995e201 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < 1.00000000000000008e-5

   1. Initial program 7.6%

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

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. metadata-eval N/A

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

      4. fp-cancel-sub-sign-inv N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(\color{blue}{\mathsf{fma}\left(\frac{-1}{3}, {im}^{2}, -2\right)} \cdot im\right) \]

      8. unpow2 N/A

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

      9. lower-*.f64 99.7

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

   5. Applied rewrites 99.7%

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

   7. Applied rewrites 99.7%

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

   if 1.00000000000000008e-5 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)))

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

      \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(im \cdot \left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right)\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(\left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right) \cdot im\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(\left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right) \cdot im\right)} \]

   5. Applied rewrites 89.6%

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

   6. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-*r* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

   8. Applied rewrites 64.4%

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

   9. Taylor expanded in re around 0

      \[\leadsto \left(\left(1 + {re}^{2} \cdot \left({re}^{2} \cdot \left(\frac{1}{24} + \frac{-1}{720} \cdot {re}^{2}\right) - \frac{1}{2}\right)\right) \cdot \mathsf{fma}\left(im \cdot im, \frac{-1}{6}, -1\right)\right) \cdot im \]
   10. Step-by-step derivation

   11. Applied rewrites 47.9%

       \[\leadsto \left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.001388888888888889, re \cdot re, 0.041666666666666664\right), re \cdot re, -0.5\right), re \cdot re, 1\right) \cdot \mathsf{fma}\left(im \cdot im, -0.16666666666666666, -1\right)\right) \cdot im \]
3. Recombined 3 regimes into one program.

4. Final simplification 79.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} - e^{im}\right) \leq -5 \cdot 10^{+201}:\\ \;\;\;\;\left(\left(1 - im\right) - e^{im}\right) \cdot 0.5\\ \mathbf{elif}\;\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} - e^{im}\right) \leq 10^{-5}:\\ \;\;\;\;\left(0.5 \cdot \cos re\right) \cdot \mathsf{fma}\left(-0.3333333333333333 \cdot \left(im \cdot im\right), im, -2 \cdot im\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.001388888888888889, re \cdot re, 0.041666666666666664\right), re \cdot re, -0.5\right), re \cdot re, 1\right) \cdot \mathsf{fma}\left(im \cdot im, -0.16666666666666666, -1\right)\right) \cdot im\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 98.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ \begin{array}{l} t_0 := \left(0.5 \cdot \cos re\right) \cdot \left(e^{-im\_m} - e^{im\_m}\right)\\ t_1 := \mathsf{fma}\left(im\_m \cdot im\_m, -0.16666666666666666, -1\right)\\ im\_s \cdot \begin{array}{l} \mathbf{if}\;t\_0 \leq -5 \cdot 10^{+201}:\\ \;\;\;\;\left(\left(1 - im\_m\right) - e^{im\_m}\right) \cdot 0.5\\ \mathbf{elif}\;t\_0 \leq 10^{-5}:\\ \;\;\;\;\left(\cos re \cdot t\_1\right) \cdot im\_m\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.001388888888888889, re \cdot re, 0.041666666666666664\right), re \cdot re, -0.5\right), re \cdot re, 1\right) \cdot t\_1\right) \cdot im\_m\\ \end{array} \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (let* ((t_0 (* (* 0.5 (cos re)) (- (exp (- im_m)) (exp im_m))))
        (t_1 (fma (* im_m im_m) -0.16666666666666666 -1.0)))
   (*
    im_s
    (if (<= t_0 -5e+201)
      (* (- (- 1.0 im_m) (exp im_m)) 0.5)
      (if (<= t_0 1e-5)
        (* (* (cos re) t_1) im_m)
        (*
         (*
          (fma
           (fma
            (fma -0.001388888888888889 (* re re) 0.041666666666666664)
            (* re re)
            -0.5)
           (* re re)
           1.0)
          t_1)
         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 = (0.5 * cos(re)) * (exp(-im_m) - exp(im_m));
	double t_1 = fma((im_m * im_m), -0.16666666666666666, -1.0);
	double tmp;
	if (t_0 <= -5e+201) {
		tmp = ((1.0 - im_m) - exp(im_m)) * 0.5;
	} else if (t_0 <= 1e-5) {
		tmp = (cos(re) * t_1) * im_m;
	} else {
		tmp = (fma(fma(fma(-0.001388888888888889, (re * re), 0.041666666666666664), (re * re), -0.5), (re * re), 1.0) * t_1) * 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(Float64(0.5 * cos(re)) * Float64(exp(Float64(-im_m)) - exp(im_m)))
	t_1 = fma(Float64(im_m * im_m), -0.16666666666666666, -1.0)
	tmp = 0.0
	if (t_0 <= -5e+201)
		tmp = Float64(Float64(Float64(1.0 - im_m) - exp(im_m)) * 0.5);
	elseif (t_0 <= 1e-5)
		tmp = Float64(Float64(cos(re) * t_1) * im_m);
	else
		tmp = Float64(Float64(fma(fma(fma(-0.001388888888888889, Float64(re * re), 0.041666666666666664), Float64(re * re), -0.5), Float64(re * re), 1.0) * t_1) * im_m);
	end
	return Float64(im_s * tmp)
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := Block[{t$95$0 = N[(N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im$95$m)], $MachinePrecision] - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(im$95$m * im$95$m), $MachinePrecision] * -0.16666666666666666 + -1.0), $MachinePrecision]}, N[(im$95$s * If[LessEqual[t$95$0, -5e+201], N[(N[(N[(1.0 - im$95$m), $MachinePrecision] - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[t$95$0, 1e-5], N[(N[(N[Cos[re], $MachinePrecision] * t$95$1), $MachinePrecision] * im$95$m), $MachinePrecision], N[(N[(N[(N[(N[(-0.001388888888888889 * N[(re * re), $MachinePrecision] + 0.041666666666666664), $MachinePrecision] * N[(re * re), $MachinePrecision] + -0.5), $MachinePrecision] * N[(re * re), $MachinePrecision] + 1.0), $MachinePrecision] * t$95$1), $MachinePrecision] * im$95$m), $MachinePrecision]]]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -4.9999999999999995e201

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

      3. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \cdot \frac{1}{2} \]

      4. lower-exp.f64 N/A

         \[\leadsto \left(\color{blue}{e^{\mathsf{neg}\left(im\right)}} - e^{im}\right) \cdot \frac{1}{2} \]

      5. lower-neg.f64 N/A

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

      6. lower-exp.f64 70.1

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

   5. Applied rewrites 70.1%

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

   6. Taylor expanded in im around 0

      \[\leadsto \left(\left(1 + -1 \cdot im\right) - e^{im}\right) \cdot \frac{1}{2} \]
   7. Step-by-step derivation

   8. Applied rewrites 70.3%

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

   if -4.9999999999999995e201 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < 1.00000000000000008e-5

   1. Initial program 7.6%

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

   3. Taylor expanded in im around 0

      \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(im \cdot \left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right)\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(\left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right) \cdot im\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(\left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right) \cdot im\right)} \]

   5. Applied rewrites 99.7%

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

   6. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-*r* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

   8. Applied rewrites 99.7%

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

   if 1.00000000000000008e-5 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)))

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

      \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(im \cdot \left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right)\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(\left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right) \cdot im\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(\left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right) \cdot im\right)} \]

   5. Applied rewrites 89.6%

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

   6. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-*r* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

   8. Applied rewrites 64.4%

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

   9. Taylor expanded in re around 0

      \[\leadsto \left(\left(1 + {re}^{2} \cdot \left({re}^{2} \cdot \left(\frac{1}{24} + \frac{-1}{720} \cdot {re}^{2}\right) - \frac{1}{2}\right)\right) \cdot \mathsf{fma}\left(im \cdot im, \frac{-1}{6}, -1\right)\right) \cdot im \]
   10. Step-by-step derivation

   11. Applied rewrites 47.9%

       \[\leadsto \left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.001388888888888889, re \cdot re, 0.041666666666666664\right), re \cdot re, -0.5\right), re \cdot re, 1\right) \cdot \mathsf{fma}\left(im \cdot im, -0.16666666666666666, -1\right)\right) \cdot im \]
3. Recombined 3 regimes into one program.

4. Final simplification 79.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} - e^{im}\right) \leq -5 \cdot 10^{+201}:\\ \;\;\;\;\left(\left(1 - im\right) - e^{im}\right) \cdot 0.5\\ \mathbf{elif}\;\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} - e^{im}\right) \leq 10^{-5}:\\ \;\;\;\;\left(\cos re \cdot \mathsf{fma}\left(im \cdot im, -0.16666666666666666, -1\right)\right) \cdot im\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.001388888888888889, re \cdot re, 0.041666666666666664\right), re \cdot re, -0.5\right), re \cdot re, 1\right) \cdot \mathsf{fma}\left(im \cdot im, -0.16666666666666666, -1\right)\right) \cdot im\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 98.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ \begin{array}{l} t_0 := \left(0.5 \cdot \cos re\right) \cdot \left(e^{-im\_m} - e^{im\_m}\right)\\ im\_s \cdot \begin{array}{l} \mathbf{if}\;t\_0 \leq -5 \cdot 10^{+201}:\\ \;\;\;\;\left(\left(1 - im\_m\right) - e^{im\_m}\right) \cdot 0.5\\ \mathbf{elif}\;t\_0 \leq 10^{-5}:\\ \;\;\;\;\left(-\cos re\right) \cdot im\_m\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.001388888888888889, re \cdot re, 0.041666666666666664\right), re \cdot re, -0.5\right), re \cdot re, 1\right) \cdot \mathsf{fma}\left(im\_m \cdot im\_m, -0.16666666666666666, -1\right)\right) \cdot im\_m\\ \end{array} \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (let* ((t_0 (* (* 0.5 (cos re)) (- (exp (- im_m)) (exp im_m)))))
   (*
    im_s
    (if (<= t_0 -5e+201)
      (* (- (- 1.0 im_m) (exp im_m)) 0.5)
      (if (<= t_0 1e-5)
        (* (- (cos re)) im_m)
        (*
         (*
          (fma
           (fma
            (fma -0.001388888888888889 (* re re) 0.041666666666666664)
            (* re re)
            -0.5)
           (* re re)
           1.0)
          (fma (* im_m im_m) -0.16666666666666666 -1.0))
         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 = (0.5 * cos(re)) * (exp(-im_m) - exp(im_m));
	double tmp;
	if (t_0 <= -5e+201) {
		tmp = ((1.0 - im_m) - exp(im_m)) * 0.5;
	} else if (t_0 <= 1e-5) {
		tmp = -cos(re) * im_m;
	} else {
		tmp = (fma(fma(fma(-0.001388888888888889, (re * re), 0.041666666666666664), (re * re), -0.5), (re * re), 1.0) * fma((im_m * im_m), -0.16666666666666666, -1.0)) * 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(Float64(0.5 * cos(re)) * Float64(exp(Float64(-im_m)) - exp(im_m)))
	tmp = 0.0
	if (t_0 <= -5e+201)
		tmp = Float64(Float64(Float64(1.0 - im_m) - exp(im_m)) * 0.5);
	elseif (t_0 <= 1e-5)
		tmp = Float64(Float64(-cos(re)) * im_m);
	else
		tmp = Float64(Float64(fma(fma(fma(-0.001388888888888889, Float64(re * re), 0.041666666666666664), Float64(re * re), -0.5), Float64(re * re), 1.0) * fma(Float64(im_m * im_m), -0.16666666666666666, -1.0)) * im_m);
	end
	return Float64(im_s * tmp)
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := Block[{t$95$0 = N[(N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im$95$m)], $MachinePrecision] - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(im$95$s * If[LessEqual[t$95$0, -5e+201], N[(N[(N[(1.0 - im$95$m), $MachinePrecision] - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[t$95$0, 1e-5], N[((-N[Cos[re], $MachinePrecision]) * im$95$m), $MachinePrecision], N[(N[(N[(N[(N[(-0.001388888888888889 * N[(re * re), $MachinePrecision] + 0.041666666666666664), $MachinePrecision] * N[(re * re), $MachinePrecision] + -0.5), $MachinePrecision] * N[(re * re), $MachinePrecision] + 1.0), $MachinePrecision] * N[(N[(im$95$m * im$95$m), $MachinePrecision] * -0.16666666666666666 + -1.0), $MachinePrecision]), $MachinePrecision] * im$95$m), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -4.9999999999999995e201

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

      3. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \cdot \frac{1}{2} \]

      4. lower-exp.f64 N/A

         \[\leadsto \left(\color{blue}{e^{\mathsf{neg}\left(im\right)}} - e^{im}\right) \cdot \frac{1}{2} \]

      5. lower-neg.f64 N/A

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

      6. lower-exp.f64 70.1

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

   5. Applied rewrites 70.1%

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

   6. Taylor expanded in im around 0

      \[\leadsto \left(\left(1 + -1 \cdot im\right) - e^{im}\right) \cdot \frac{1}{2} \]
   7. Step-by-step derivation

   8. Applied rewrites 70.3%

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

   if -4.9999999999999995e201 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < 1.00000000000000008e-5

   1. Initial program 7.6%

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

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-cos.f64 99.4

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

   5. Applied rewrites 99.4%

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

   if 1.00000000000000008e-5 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)))

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

      \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(im \cdot \left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right)\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(\left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right) \cdot im\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(\left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right) \cdot im\right)} \]

   5. Applied rewrites 89.6%

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

   6. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-*r* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

   8. Applied rewrites 64.4%

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

   9. Taylor expanded in re around 0

      \[\leadsto \left(\left(1 + {re}^{2} \cdot \left({re}^{2} \cdot \left(\frac{1}{24} + \frac{-1}{720} \cdot {re}^{2}\right) - \frac{1}{2}\right)\right) \cdot \mathsf{fma}\left(im \cdot im, \frac{-1}{6}, -1\right)\right) \cdot im \]
   10. Step-by-step derivation

   11. Applied rewrites 47.9%

       \[\leadsto \left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.001388888888888889, re \cdot re, 0.041666666666666664\right), re \cdot re, -0.5\right), re \cdot re, 1\right) \cdot \mathsf{fma}\left(im \cdot im, -0.16666666666666666, -1\right)\right) \cdot im \]
3. Recombined 3 regimes into one program.

4. Final simplification 78.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} - e^{im}\right) \leq -5 \cdot 10^{+201}:\\ \;\;\;\;\left(\left(1 - im\right) - e^{im}\right) \cdot 0.5\\ \mathbf{elif}\;\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} - e^{im}\right) \leq 10^{-5}:\\ \;\;\;\;\left(-\cos re\right) \cdot im\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.001388888888888889, re \cdot re, 0.041666666666666664\right), re \cdot re, -0.5\right), re \cdot re, 1\right) \cdot \mathsf{fma}\left(im \cdot im, -0.16666666666666666, -1\right)\right) \cdot im\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 94.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ \begin{array}{l} t_0 := \left(0.5 \cdot \cos re\right) \cdot \left(e^{-im\_m} - e^{im\_m}\right)\\ im\_s \cdot \begin{array}{l} \mathbf{if}\;t\_0 \leq -2 \cdot 10^{-7}:\\ \;\;\;\;0.5 \cdot \mathsf{fma}\left(\left(\left(\left(\left(-0.0003968253968253968 \cdot \left(im\_m \cdot im\_m\right) - 0.016666666666666666\right) \cdot im\_m\right) \cdot im\_m - 0.3333333333333333\right) \cdot im\_m\right) \cdot im\_m, im\_m, -2 \cdot im\_m\right)\\ \mathbf{elif}\;t\_0 \leq 10^{-5}:\\ \;\;\;\;\left(-\cos re\right) \cdot im\_m\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.001388888888888889, re \cdot re, 0.041666666666666664\right), re \cdot re, -0.5\right), re \cdot re, 1\right) \cdot \mathsf{fma}\left(im\_m \cdot im\_m, -0.16666666666666666, -1\right)\right) \cdot im\_m\\ \end{array} \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (let* ((t_0 (* (* 0.5 (cos re)) (- (exp (- im_m)) (exp im_m)))))
   (*
    im_s
    (if (<= t_0 -2e-7)
      (*
       0.5
       (fma
        (*
         (*
          (-
           (*
            (*
             (- (* -0.0003968253968253968 (* im_m im_m)) 0.016666666666666666)
             im_m)
            im_m)
           0.3333333333333333)
          im_m)
         im_m)
        im_m
        (* -2.0 im_m)))
      (if (<= t_0 1e-5)
        (* (- (cos re)) im_m)
        (*
         (*
          (fma
           (fma
            (fma -0.001388888888888889 (* re re) 0.041666666666666664)
            (* re re)
            -0.5)
           (* re re)
           1.0)
          (fma (* im_m im_m) -0.16666666666666666 -1.0))
         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 = (0.5 * cos(re)) * (exp(-im_m) - exp(im_m));
	double tmp;
	if (t_0 <= -2e-7) {
		tmp = 0.5 * fma((((((((-0.0003968253968253968 * (im_m * im_m)) - 0.016666666666666666) * im_m) * im_m) - 0.3333333333333333) * im_m) * im_m), im_m, (-2.0 * im_m));
	} else if (t_0 <= 1e-5) {
		tmp = -cos(re) * im_m;
	} else {
		tmp = (fma(fma(fma(-0.001388888888888889, (re * re), 0.041666666666666664), (re * re), -0.5), (re * re), 1.0) * fma((im_m * im_m), -0.16666666666666666, -1.0)) * 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(Float64(0.5 * cos(re)) * Float64(exp(Float64(-im_m)) - exp(im_m)))
	tmp = 0.0
	if (t_0 <= -2e-7)
		tmp = Float64(0.5 * fma(Float64(Float64(Float64(Float64(Float64(Float64(Float64(-0.0003968253968253968 * Float64(im_m * im_m)) - 0.016666666666666666) * im_m) * im_m) - 0.3333333333333333) * im_m) * im_m), im_m, Float64(-2.0 * im_m)));
	elseif (t_0 <= 1e-5)
		tmp = Float64(Float64(-cos(re)) * im_m);
	else
		tmp = Float64(Float64(fma(fma(fma(-0.001388888888888889, Float64(re * re), 0.041666666666666664), Float64(re * re), -0.5), Float64(re * re), 1.0) * fma(Float64(im_m * im_m), -0.16666666666666666, -1.0)) * im_m);
	end
	return Float64(im_s * tmp)
end

Wolfram

im\_m = N[Abs[im], $MachinePrecision]
im\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[im]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[im$95$s_, re_, im$95$m_] := Block[{t$95$0 = N[(N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im$95$m)], $MachinePrecision] - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(im$95$s * If[LessEqual[t$95$0, -2e-7], N[(0.5 * N[(N[(N[(N[(N[(N[(N[(N[(-0.0003968253968253968 * N[(im$95$m * im$95$m), $MachinePrecision]), $MachinePrecision] - 0.016666666666666666), $MachinePrecision] * im$95$m), $MachinePrecision] * im$95$m), $MachinePrecision] - 0.3333333333333333), $MachinePrecision] * im$95$m), $MachinePrecision] * im$95$m), $MachinePrecision] * im$95$m + N[(-2.0 * im$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 1e-5], N[((-N[Cos[re], $MachinePrecision]) * im$95$m), $MachinePrecision], N[(N[(N[(N[(N[(-0.001388888888888889 * N[(re * re), $MachinePrecision] + 0.041666666666666664), $MachinePrecision] * N[(re * re), $MachinePrecision] + -0.5), $MachinePrecision] * N[(re * re), $MachinePrecision] + 1.0), $MachinePrecision] * N[(N[(im$95$m * im$95$m), $MachinePrecision] * -0.16666666666666666 + -1.0), $MachinePrecision]), $MachinePrecision] * im$95$m), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -1.9999999999999999e-7

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

      \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(im \cdot \left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right)\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(\left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right) \cdot im\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(\left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right) \cdot im\right)} \]

   5. Applied rewrites 80.3%

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

   6. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2}} \cdot \left(\mathsf{fma}\left(\left(\left(\frac{-1}{2520} \cdot \left(im \cdot im\right) - \frac{1}{60}\right) \cdot im\right) \cdot im - \frac{1}{3}, im \cdot im, -2\right) \cdot im\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 57.5%

      \[\leadsto \color{blue}{0.5} \cdot \left(\mathsf{fma}\left(\left(\left(-0.0003968253968253968 \cdot \left(im \cdot im\right) - 0.016666666666666666\right) \cdot im\right) \cdot im - 0.3333333333333333, im \cdot im, -2\right) \cdot im\right) \]
   9. Step-by-step derivation

   10. Applied rewrites 57.5%

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

   if -1.9999999999999999e-7 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < 1.00000000000000008e-5

   1. Initial program 7.6%

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

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-cos.f64 99.4

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

   5. Applied rewrites 99.4%

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

   if 1.00000000000000008e-5 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)))

   1. Initial program 100.0%

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

   3. Taylor expanded in im around 0

      \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(im \cdot \left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right)\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(\left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right) \cdot im\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(\left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right) \cdot im\right)} \]

   5. Applied rewrites 89.6%

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

   6. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-*r* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

   8. Applied rewrites 64.4%

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

   9. Taylor expanded in re around 0

      \[\leadsto \left(\left(1 + {re}^{2} \cdot \left({re}^{2} \cdot \left(\frac{1}{24} + \frac{-1}{720} \cdot {re}^{2}\right) - \frac{1}{2}\right)\right) \cdot \mathsf{fma}\left(im \cdot im, \frac{-1}{6}, -1\right)\right) \cdot im \]
   10. Step-by-step derivation

   11. Applied rewrites 47.9%

       \[\leadsto \left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.001388888888888889, re \cdot re, 0.041666666666666664\right), re \cdot re, -0.5\right), re \cdot re, 1\right) \cdot \mathsf{fma}\left(im \cdot im, -0.16666666666666666, -1\right)\right) \cdot im \]
3. Recombined 3 regimes into one program.

4. Final simplification 75.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} - e^{im}\right) \leq -2 \cdot 10^{-7}:\\ \;\;\;\;0.5 \cdot \mathsf{fma}\left(\left(\left(\left(\left(-0.0003968253968253968 \cdot \left(im \cdot im\right) - 0.016666666666666666\right) \cdot im\right) \cdot im - 0.3333333333333333\right) \cdot im\right) \cdot im, im, -2 \cdot im\right)\\ \mathbf{elif}\;\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} - e^{im}\right) \leq 10^{-5}:\\ \;\;\;\;\left(-\cos re\right) \cdot im\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.001388888888888889, re \cdot re, 0.041666666666666664\right), re \cdot re, -0.5\right), re \cdot re, 1\right) \cdot \mathsf{fma}\left(im \cdot im, -0.16666666666666666, -1\right)\right) \cdot im\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 72.5% accurate, 0.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}\;\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im\_m} - e^{im\_m}\right) \leq 0:\\ \;\;\;\;0.5 \cdot \mathsf{fma}\left(\left(\left(\left(\left(-0.0003968253968253968 \cdot \left(im\_m \cdot im\_m\right) - 0.016666666666666666\right) \cdot im\_m\right) \cdot im\_m - 0.3333333333333333\right) \cdot im\_m\right) \cdot im\_m, im\_m, -2 \cdot im\_m\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.001388888888888889, re \cdot re, 0.041666666666666664\right), re \cdot re, -0.5\right), re \cdot re, 1\right) \cdot \mathsf{fma}\left(im\_m \cdot im\_m, -0.16666666666666666, -1\right)\right) \cdot im\_m\\ \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= (* (* 0.5 (cos re)) (- (exp (- im_m)) (exp im_m))) 0.0)
    (*
     0.5
     (fma
      (*
       (*
        (-
         (*
          (*
           (- (* -0.0003968253968253968 (* im_m im_m)) 0.016666666666666666)
           im_m)
          im_m)
         0.3333333333333333)
        im_m)
       im_m)
      im_m
      (* -2.0 im_m)))
    (*
     (*
      (fma
       (fma
        (fma -0.001388888888888889 (* re re) 0.041666666666666664)
        (* re re)
        -0.5)
       (* re re)
       1.0)
      (fma (* im_m im_m) -0.16666666666666666 -1.0))
     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 (((0.5 * cos(re)) * (exp(-im_m) - exp(im_m))) <= 0.0) {
		tmp = 0.5 * fma((((((((-0.0003968253968253968 * (im_m * im_m)) - 0.016666666666666666) * im_m) * im_m) - 0.3333333333333333) * im_m) * im_m), im_m, (-2.0 * im_m));
	} else {
		tmp = (fma(fma(fma(-0.001388888888888889, (re * re), 0.041666666666666664), (re * re), -0.5), (re * re), 1.0) * fma((im_m * im_m), -0.16666666666666666, -1.0)) * 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 (Float64(Float64(0.5 * cos(re)) * Float64(exp(Float64(-im_m)) - exp(im_m))) <= 0.0)
		tmp = Float64(0.5 * fma(Float64(Float64(Float64(Float64(Float64(Float64(Float64(-0.0003968253968253968 * Float64(im_m * im_m)) - 0.016666666666666666) * im_m) * im_m) - 0.3333333333333333) * im_m) * im_m), im_m, Float64(-2.0 * im_m)));
	else
		tmp = Float64(Float64(fma(fma(fma(-0.001388888888888889, Float64(re * re), 0.041666666666666664), Float64(re * re), -0.5), Float64(re * re), 1.0) * fma(Float64(im_m * im_m), -0.16666666666666666, -1.0)) * im_m);
	end
	return Float64(im_s * tmp)
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < 0.0

   1. Initial program 39.4%

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

   3. Taylor expanded in im around 0

      \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(im \cdot \left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right)\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(\left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right) \cdot im\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(\left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right) \cdot im\right)} \]

   5. Applied rewrites 92.8%

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

   6. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2}} \cdot \left(\mathsf{fma}\left(\left(\left(\frac{-1}{2520} \cdot \left(im \cdot im\right) - \frac{1}{60}\right) \cdot im\right) \cdot im - \frac{1}{3}, im \cdot im, -2\right) \cdot im\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 55.4%

      \[\leadsto \color{blue}{0.5} \cdot \left(\mathsf{fma}\left(\left(\left(-0.0003968253968253968 \cdot \left(im \cdot im\right) - 0.016666666666666666\right) \cdot im\right) \cdot im - 0.3333333333333333, im \cdot im, -2\right) \cdot im\right) \]
   9. Step-by-step derivation

   10. Applied rewrites 55.4%

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

   if 0.0 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)))

   1. Initial program 98.6%

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

   3. Taylor expanded in im around 0

      \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(im \cdot \left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right)\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(\left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right) \cdot im\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(\left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right) \cdot im\right)} \]

   5. Applied rewrites 90.0%

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

   6. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-*r* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

   8. Applied rewrites 66.0%

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

   9. Taylor expanded in re around 0

      \[\leadsto \left(\left(1 + {re}^{2} \cdot \left({re}^{2} \cdot \left(\frac{1}{24} + \frac{-1}{720} \cdot {re}^{2}\right) - \frac{1}{2}\right)\right) \cdot \mathsf{fma}\left(im \cdot im, \frac{-1}{6}, -1\right)\right) \cdot im \]
   10. Step-by-step derivation

   11. Applied rewrites 48.7%

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

4. Final simplification 53.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} - e^{im}\right) \leq 0:\\ \;\;\;\;0.5 \cdot \mathsf{fma}\left(\left(\left(\left(\left(-0.0003968253968253968 \cdot \left(im \cdot im\right) - 0.016666666666666666\right) \cdot im\right) \cdot im - 0.3333333333333333\right) \cdot im\right) \cdot im, im, -2 \cdot im\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.001388888888888889, re \cdot re, 0.041666666666666664\right), re \cdot re, -0.5\right), re \cdot re, 1\right) \cdot \mathsf{fma}\left(im \cdot im, -0.16666666666666666, -1\right)\right) \cdot im\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 71.8% accurate, 0.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}\;\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im\_m} - e^{im\_m}\right) \leq 0:\\ \;\;\;\;0.5 \cdot \mathsf{fma}\left(\left(\left(\left(\left(-0.0003968253968253968 \cdot \left(im\_m \cdot im\_m\right) - 0.016666666666666666\right) \cdot im\_m\right) \cdot im\_m - 0.3333333333333333\right) \cdot im\_m\right) \cdot im\_m, im\_m, -2 \cdot im\_m\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.001388888888888889, re \cdot re, 0.041666666666666664\right), re \cdot re, -0.5\right), re \cdot re, 1\right) \cdot \left(-im\_m\right)\\ \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= (* (* 0.5 (cos re)) (- (exp (- im_m)) (exp im_m))) 0.0)
    (*
     0.5
     (fma
      (*
       (*
        (-
         (*
          (*
           (- (* -0.0003968253968253968 (* im_m im_m)) 0.016666666666666666)
           im_m)
          im_m)
         0.3333333333333333)
        im_m)
       im_m)
      im_m
      (* -2.0 im_m)))
    (*
     (fma
      (fma
       (fma -0.001388888888888889 (* re re) 0.041666666666666664)
       (* re re)
       -0.5)
      (* re re)
      1.0)
     (- 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 (((0.5 * cos(re)) * (exp(-im_m) - exp(im_m))) <= 0.0) {
		tmp = 0.5 * fma((((((((-0.0003968253968253968 * (im_m * im_m)) - 0.016666666666666666) * im_m) * im_m) - 0.3333333333333333) * im_m) * im_m), im_m, (-2.0 * im_m));
	} else {
		tmp = fma(fma(fma(-0.001388888888888889, (re * re), 0.041666666666666664), (re * re), -0.5), (re * re), 1.0) * -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 (Float64(Float64(0.5 * cos(re)) * Float64(exp(Float64(-im_m)) - exp(im_m))) <= 0.0)
		tmp = Float64(0.5 * fma(Float64(Float64(Float64(Float64(Float64(Float64(Float64(-0.0003968253968253968 * Float64(im_m * im_m)) - 0.016666666666666666) * im_m) * im_m) - 0.3333333333333333) * im_m) * im_m), im_m, Float64(-2.0 * im_m)));
	else
		tmp = Float64(fma(fma(fma(-0.001388888888888889, Float64(re * re), 0.041666666666666664), Float64(re * re), -0.5), Float64(re * re), 1.0) * Float64(-im_m));
	end
	return Float64(im_s * tmp)
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < 0.0

   1. Initial program 39.4%

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

   3. Taylor expanded in im around 0

      \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(im \cdot \left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right)\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(\left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right) \cdot im\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(\left({im}^{2} \cdot \left({im}^{2} \cdot \left(\frac{-1}{2520} \cdot {im}^{2} - \frac{1}{60}\right) - \frac{1}{3}\right) - 2\right) \cdot im\right)} \]

   5. Applied rewrites 92.8%

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

   6. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2}} \cdot \left(\mathsf{fma}\left(\left(\left(\frac{-1}{2520} \cdot \left(im \cdot im\right) - \frac{1}{60}\right) \cdot im\right) \cdot im - \frac{1}{3}, im \cdot im, -2\right) \cdot im\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 55.4%

      \[\leadsto \color{blue}{0.5} \cdot \left(\mathsf{fma}\left(\left(\left(-0.0003968253968253968 \cdot \left(im \cdot im\right) - 0.016666666666666666\right) \cdot im\right) \cdot im - 0.3333333333333333, im \cdot im, -2\right) \cdot im\right) \]
   9. Step-by-step derivation

   10. Applied rewrites 55.4%

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

   if 0.0 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)))

   1. Initial program 98.6%

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

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-cos.f64 8.7

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

   5. Applied rewrites 8.7%

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

   6. Taylor expanded in re around 0

      \[\leadsto \left(-\left(1 + {re}^{2} \cdot \left({re}^{2} \cdot \left(\frac{1}{24} + \frac{-1}{720} \cdot {re}^{2}\right) - \frac{1}{2}\right)\right)\right) \cdot im \]
   7. Step-by-step derivation

   8. Applied rewrites 22.9%

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

4. Final simplification 46.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} - e^{im}\right) \leq 0:\\ \;\;\;\;0.5 \cdot \mathsf{fma}\left(\left(\left(\left(\left(-0.0003968253968253968 \cdot \left(im \cdot im\right) - 0.016666666666666666\right) \cdot im\right) \cdot im - 0.3333333333333333\right) \cdot im\right) \cdot im, im, -2 \cdot im\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.001388888888888889, re \cdot re, 0.041666666666666664\right), re \cdot re, -0.5\right), re \cdot re, 1\right) \cdot \left(-im\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 71.8% accurate, 0.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}\;\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im\_m} - e^{im\_m}\right) \leq 0:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.0001984126984126984, im\_m \cdot im\_m, -0.008333333333333333\right), im\_m \cdot im\_m, -0.16666666666666666\right) \cdot im\_m, im\_m, -1\right) \cdot im\_m\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.001388888888888889, re \cdot re, 0.041666666666666664\right), re \cdot re, -0.5\right), re \cdot re, 1\right) \cdot \left(-im\_m\right)\\ \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= (* (* 0.5 (cos re)) (- (exp (- im_m)) (exp im_m))) 0.0)
    (*
     (fma
      (*
       (fma
        (fma -0.0001984126984126984 (* im_m im_m) -0.008333333333333333)
        (* im_m im_m)
        -0.16666666666666666)
       im_m)
      im_m
      -1.0)
     im_m)
    (*
     (fma
      (fma
       (fma -0.001388888888888889 (* re re) 0.041666666666666664)
       (* re re)
       -0.5)
      (* re re)
      1.0)
     (- 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 (((0.5 * cos(re)) * (exp(-im_m) - exp(im_m))) <= 0.0) {
		tmp = fma((fma(fma(-0.0001984126984126984, (im_m * im_m), -0.008333333333333333), (im_m * im_m), -0.16666666666666666) * im_m), im_m, -1.0) * im_m;
	} else {
		tmp = fma(fma(fma(-0.001388888888888889, (re * re), 0.041666666666666664), (re * re), -0.5), (re * re), 1.0) * -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 (Float64(Float64(0.5 * cos(re)) * Float64(exp(Float64(-im_m)) - exp(im_m))) <= 0.0)
		tmp = Float64(fma(Float64(fma(fma(-0.0001984126984126984, Float64(im_m * im_m), -0.008333333333333333), Float64(im_m * im_m), -0.16666666666666666) * im_m), im_m, -1.0) * im_m);
	else
		tmp = Float64(fma(fma(fma(-0.001388888888888889, Float64(re * re), 0.041666666666666664), Float64(re * re), -0.5), Float64(re * re), 1.0) * Float64(-im_m));
	end
	return Float64(im_s * tmp)
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < 0.0

   1. Initial program 39.4%

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

   3. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

      3. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \cdot \frac{1}{2} \]

      4. lower-exp.f64 N/A

         \[\leadsto \left(\color{blue}{e^{\mathsf{neg}\left(im\right)}} - e^{im}\right) \cdot \frac{1}{2} \]

      5. lower-neg.f64 N/A

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

      6. lower-exp.f64 28.6

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

   5. Applied rewrites 28.6%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 55.4%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.0001984126984126984, im \cdot im, -0.008333333333333333\right), im \cdot im, -0.16666666666666666\right), im \cdot im, -1\right) \cdot \color{blue}{im} \]
   9. Step-by-step derivation

   10. Applied rewrites 55.4%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.0001984126984126984, im \cdot im, -0.008333333333333333\right), im \cdot im, -0.16666666666666666\right) \cdot im, im, -1\right) \cdot im \]

   if 0.0 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)))

   1. Initial program 98.6%

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

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-cos.f64 8.7

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

   5. Applied rewrites 8.7%

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

   6. Taylor expanded in re around 0

      \[\leadsto \left(-\left(1 + {re}^{2} \cdot \left({re}^{2} \cdot \left(\frac{1}{24} + \frac{-1}{720} \cdot {re}^{2}\right) - \frac{1}{2}\right)\right)\right) \cdot im \]
   7. Step-by-step derivation

   8. Applied rewrites 22.9%

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

4. Final simplification 46.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} - e^{im}\right) \leq 0:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.0001984126984126984, im \cdot im, -0.008333333333333333\right), im \cdot im, -0.16666666666666666\right) \cdot im, im, -1\right) \cdot im\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.001388888888888889, re \cdot re, 0.041666666666666664\right), re \cdot re, -0.5\right), re \cdot re, 1\right) \cdot \left(-im\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 53.1% accurate, 0.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}\;\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im\_m} - e^{im\_m}\right) \leq -5 \cdot 10^{+201}:\\ \;\;\;\;\left(\left(im\_m \cdot im\_m\right) \cdot -0.16666666666666666\right) \cdot im\_m\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(-2 \cdot im\_m\right)\\ \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= (* (* 0.5 (cos re)) (- (exp (- im_m)) (exp im_m))) -5e+201)
    (* (* (* im_m im_m) -0.16666666666666666) im_m)
    (* 0.5 (* -2.0 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 (((0.5 * cos(re)) * (exp(-im_m) - exp(im_m))) <= -5e+201) {
		tmp = ((im_m * im_m) * -0.16666666666666666) * im_m;
	} else {
		tmp = 0.5 * (-2.0 * im_m);
	}
	return im_s * tmp;
}

Fortran

im\_m =     private
im\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(im_s, re, im_m)
use fmin_fmax_functions
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (((0.5d0 * cos(re)) * (exp(-im_m) - exp(im_m))) <= (-5d+201)) then
        tmp = ((im_m * im_m) * (-0.16666666666666666d0)) * im_m
    else
        tmp = 0.5d0 * ((-2.0d0) * 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 (((0.5 * Math.cos(re)) * (Math.exp(-im_m) - Math.exp(im_m))) <= -5e+201) {
		tmp = ((im_m * im_m) * -0.16666666666666666) * im_m;
	} else {
		tmp = 0.5 * (-2.0 * 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 ((0.5 * math.cos(re)) * (math.exp(-im_m) - math.exp(im_m))) <= -5e+201:
		tmp = ((im_m * im_m) * -0.16666666666666666) * im_m
	else:
		tmp = 0.5 * (-2.0 * 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 (Float64(Float64(0.5 * cos(re)) * Float64(exp(Float64(-im_m)) - exp(im_m))) <= -5e+201)
		tmp = Float64(Float64(Float64(im_m * im_m) * -0.16666666666666666) * im_m);
	else
		tmp = Float64(0.5 * Float64(-2.0 * 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 (((0.5 * cos(re)) * (exp(-im_m) - exp(im_m))) <= -5e+201)
		tmp = ((im_m * im_m) * -0.16666666666666666) * im_m;
	else
		tmp = 0.5 * (-2.0 * 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[N[(N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im$95$m)], $MachinePrecision] - N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e+201], N[(N[(N[(im$95$m * im$95$m), $MachinePrecision] * -0.16666666666666666), $MachinePrecision] * im$95$m), $MachinePrecision], N[(0.5 * N[(-2.0 * im$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -4.9999999999999995e201

   1. Initial program 100.0%

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

   3. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

      3. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \cdot \frac{1}{2} \]

      4. lower-exp.f64 N/A

         \[\leadsto \left(\color{blue}{e^{\mathsf{neg}\left(im\right)}} - e^{im}\right) \cdot \frac{1}{2} \]

      5. lower-neg.f64 N/A

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

      6. lower-exp.f64 70.1

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

   5. Applied rewrites 70.1%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 44.6%

      \[\leadsto \mathsf{fma}\left(im \cdot im, -0.16666666666666666, -1\right) \cdot \color{blue}{im} \]

   9. Taylor expanded in im around inf

      \[\leadsto \left(\frac{-1}{6} \cdot {im}^{2}\right) \cdot im \]
   10. Step-by-step derivation

   11. Applied rewrites 44.6%

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

   if -4.9999999999999995e201 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (-.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)))

   1. Initial program 38.9%

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

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. metadata-eval N/A

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

      4. fp-cancel-sub-sign-inv N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(\color{blue}{\mathsf{fma}\left(\frac{-1}{3}, {im}^{2}, -2\right)} \cdot im\right) \]

      8. unpow2 N/A

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

      9. lower-*.f64 87.8

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

   5. Applied rewrites 87.8%

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

   7. Applied rewrites 87.8%

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

   8. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2}} \cdot \mathsf{fma}\left(\frac{-1}{3} \cdot \left(im \cdot im\right), im, -2 \cdot im\right) \]
   9. Step-by-step derivation

   10. Applied rewrites 52.6%

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

   11. Taylor expanded in im around 0

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

   13. Applied rewrites 37.5%

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

4. Final simplification 39.4%

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

Alternative 10: 62.7% accurate, 1.3× speedup

Math

\[\begin{array}{l} im\_m = \left|im\right| \\ im\_s = \mathsf{copysign}\left(1, im\right) \\ \begin{array}{l} t_0 := 0.5 \cdot \cos re\\ im\_s \cdot \begin{array}{l} \mathbf{if}\;t\_0 \leq -0.02:\\ \;\;\;\;\mathsf{fma}\left(re \cdot re, 0.5, -1\right) \cdot im\_m\\ \mathbf{elif}\;t\_0 \leq 0.498:\\ \;\;\;\;\mathsf{fma}\left(\left(-0.041666666666666664 \cdot \left(re \cdot re\right)\right) \cdot re, re, -1\right) \cdot im\_m\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-0.16666666666666666 \cdot \left(im\_m \cdot im\_m\right), im\_m, -im\_m\right)\\ \end{array} \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (let* ((t_0 (* 0.5 (cos re))))
   (*
    im_s
    (if (<= t_0 -0.02)
      (* (fma (* re re) 0.5 -1.0) im_m)
      (if (<= t_0 0.498)
        (* (fma (* (* -0.041666666666666664 (* re re)) re) re -1.0) im_m)
        (fma (* -0.16666666666666666 (* im_m im_m)) im_m (- 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 = 0.5 * cos(re);
	double tmp;
	if (t_0 <= -0.02) {
		tmp = fma((re * re), 0.5, -1.0) * im_m;
	} else if (t_0 <= 0.498) {
		tmp = fma(((-0.041666666666666664 * (re * re)) * re), re, -1.0) * im_m;
	} else {
		tmp = fma((-0.16666666666666666 * (im_m * im_m)), im_m, -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(0.5 * cos(re))
	tmp = 0.0
	if (t_0 <= -0.02)
		tmp = Float64(fma(Float64(re * re), 0.5, -1.0) * im_m);
	elseif (t_0 <= 0.498)
		tmp = Float64(fma(Float64(Float64(-0.041666666666666664 * Float64(re * re)) * re), re, -1.0) * im_m);
	else
		tmp = fma(Float64(-0.16666666666666666 * Float64(im_m * im_m)), im_m, Float64(-im_m));
	end
	return Float64(im_s * tmp)
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) < -0.0200000000000000004

   1. Initial program 51.5%

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

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-cos.f64 54.0

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

   5. Applied rewrites 54.0%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 40.2%

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

   if -0.0200000000000000004 < (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) < 0.498

   1. Initial program 58.3%

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

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-cos.f64 47.8

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

   5. Applied rewrites 47.8%

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

   6. Taylor expanded in re around 0

      \[\leadsto \left({re}^{2} \cdot \left(\frac{1}{2} + \frac{-1}{24} \cdot {re}^{2}\right) - 1\right) \cdot im \]
   7. Step-by-step derivation

   8. Applied rewrites 51.9%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(-0.041666666666666664, re \cdot re, 0.5\right) \cdot re, re, -1\right) \cdot im \]

   9. Taylor expanded in re around inf

      \[\leadsto \mathsf{fma}\left(\left(\frac{-1}{24} \cdot {re}^{2}\right) \cdot re, re, -1\right) \cdot im \]
   10. Step-by-step derivation

   11. Applied rewrites 51.9%

       \[\leadsto \mathsf{fma}\left(\left(-0.041666666666666664 \cdot \left(re \cdot re\right)\right) \cdot re, re, -1\right) \cdot im \]

   if 0.498 < (*.f64 #s(literal 1/2 binary64) (cos.f64 re))

   1. Initial program 55.1%

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

   3. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

      3. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \cdot \frac{1}{2} \]

      4. lower-exp.f64 N/A

         \[\leadsto \left(\color{blue}{e^{\mathsf{neg}\left(im\right)}} - e^{im}\right) \cdot \frac{1}{2} \]

      5. lower-neg.f64 N/A

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

      6. lower-exp.f64 55.1

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

   5. Applied rewrites 55.1%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 78.9%

      \[\leadsto \mathsf{fma}\left(im \cdot im, -0.16666666666666666, -1\right) \cdot \color{blue}{im} \]
   9. Step-by-step derivation

   10. Applied rewrites 78.9%

       \[\leadsto \mathsf{fma}\left(-0.16666666666666666 \cdot \left(im \cdot im\right), im, -1 \cdot im\right) \]
3. Recombined 3 regimes into one program.

4. Final simplification 62.4%

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

Alternative 11: 71.0% accurate, 2.1× 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}\;0.5 \cdot \cos re \leq -0.075:\\ \;\;\;\;\mathsf{fma}\left(re \cdot re, -0.25, 0.5\right) \cdot \left(\mathsf{fma}\left(-0.3333333333333333, im\_m \cdot im\_m, -2\right) \cdot im\_m\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.0001984126984126984, im\_m \cdot im\_m, -0.008333333333333333\right), im\_m \cdot im\_m, -0.16666666666666666\right) \cdot im\_m, im\_m, -1\right) \cdot im\_m\\ \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= (* 0.5 (cos re)) -0.075)
    (*
     (fma (* re re) -0.25 0.5)
     (* (fma -0.3333333333333333 (* im_m im_m) -2.0) im_m))
    (*
     (fma
      (*
       (fma
        (fma -0.0001984126984126984 (* im_m im_m) -0.008333333333333333)
        (* im_m im_m)
        -0.16666666666666666)
       im_m)
      im_m
      -1.0)
     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 ((0.5 * cos(re)) <= -0.075) {
		tmp = fma((re * re), -0.25, 0.5) * (fma(-0.3333333333333333, (im_m * im_m), -2.0) * im_m);
	} else {
		tmp = fma((fma(fma(-0.0001984126984126984, (im_m * im_m), -0.008333333333333333), (im_m * im_m), -0.16666666666666666) * im_m), im_m, -1.0) * 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 (Float64(0.5 * cos(re)) <= -0.075)
		tmp = Float64(fma(Float64(re * re), -0.25, 0.5) * Float64(fma(-0.3333333333333333, Float64(im_m * im_m), -2.0) * im_m));
	else
		tmp = Float64(fma(Float64(fma(fma(-0.0001984126984126984, Float64(im_m * im_m), -0.008333333333333333), Float64(im_m * im_m), -0.16666666666666666) * im_m), im_m, -1.0) * im_m);
	end
	return Float64(im_s * tmp)
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) < -0.0749999999999999972

   1. Initial program 54.3%

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

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. metadata-eval N/A

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

      4. fp-cancel-sub-sign-inv N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(\color{blue}{\mathsf{fma}\left(\frac{-1}{3}, {im}^{2}, -2\right)} \cdot im\right) \]

      8. unpow2 N/A

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

      9. lower-*.f64 81.6

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

   5. Applied rewrites 81.6%

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

   6. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\left(\frac{1}{2} + \frac{-1}{4} \cdot {re}^{2}\right)} \cdot \left(\mathsf{fma}\left(\frac{-1}{3}, im \cdot im, -2\right) \cdot im\right) \]
   7. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\left(\frac{-1}{4} \cdot {re}^{2} + \frac{1}{2}\right)} \cdot \left(\mathsf{fma}\left(\frac{-1}{3}, im \cdot im, -2\right) \cdot im\right) \]

      2. *-commutative N/A

         \[\leadsto \left(\color{blue}{{re}^{2} \cdot \frac{-1}{4}} + \frac{1}{2}\right) \cdot \left(\mathsf{fma}\left(\frac{-1}{3}, im \cdot im, -2\right) \cdot im\right) \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({re}^{2}, \frac{-1}{4}, \frac{1}{2}\right)} \cdot \left(\mathsf{fma}\left(\frac{-1}{3}, im \cdot im, -2\right) \cdot im\right) \]

      4. unpow2 N/A

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

      5. lower-*.f64 49.8

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

   8. Applied rewrites 49.8%

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

   if -0.0749999999999999972 < (*.f64 #s(literal 1/2 binary64) (cos.f64 re))

   1. Initial program 55.1%

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

   3. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

      3. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \cdot \frac{1}{2} \]

      4. lower-exp.f64 N/A

         \[\leadsto \left(\color{blue}{e^{\mathsf{neg}\left(im\right)}} - e^{im}\right) \cdot \frac{1}{2} \]

      5. lower-neg.f64 N/A

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

      6. lower-exp.f64 54.9

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

   5. Applied rewrites 54.9%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 79.3%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.0001984126984126984, im \cdot im, -0.008333333333333333\right), im \cdot im, -0.16666666666666666\right), im \cdot im, -1\right) \cdot \color{blue}{im} \]
   9. Step-by-step derivation

   10. Applied rewrites 79.3%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.0001984126984126984, im \cdot im, -0.008333333333333333\right), im \cdot im, -0.16666666666666666\right) \cdot im, im, -1\right) \cdot im \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 12: 70.9% accurate, 2.1× 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}\;0.5 \cdot \cos re \leq -0.075:\\ \;\;\;\;\mathsf{fma}\left(re \cdot re, -0.25, 0.5\right) \cdot \left(\mathsf{fma}\left(-0.3333333333333333, im\_m \cdot im\_m, -2\right) \cdot im\_m\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-0.0001984126984126984 \cdot \left(im\_m \cdot im\_m\right), im\_m \cdot im\_m, -0.16666666666666666\right), im\_m \cdot im\_m, -1\right) \cdot im\_m\\ \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= (* 0.5 (cos re)) -0.075)
    (*
     (fma (* re re) -0.25 0.5)
     (* (fma -0.3333333333333333 (* im_m im_m) -2.0) im_m))
    (*
     (fma
      (fma
       (* -0.0001984126984126984 (* im_m im_m))
       (* im_m im_m)
       -0.16666666666666666)
      (* im_m im_m)
      -1.0)
     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 ((0.5 * cos(re)) <= -0.075) {
		tmp = fma((re * re), -0.25, 0.5) * (fma(-0.3333333333333333, (im_m * im_m), -2.0) * im_m);
	} else {
		tmp = fma(fma((-0.0001984126984126984 * (im_m * im_m)), (im_m * im_m), -0.16666666666666666), (im_m * im_m), -1.0) * 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 (Float64(0.5 * cos(re)) <= -0.075)
		tmp = Float64(fma(Float64(re * re), -0.25, 0.5) * Float64(fma(-0.3333333333333333, Float64(im_m * im_m), -2.0) * im_m));
	else
		tmp = Float64(fma(fma(Float64(-0.0001984126984126984 * Float64(im_m * im_m)), Float64(im_m * im_m), -0.16666666666666666), Float64(im_m * im_m), -1.0) * im_m);
	end
	return Float64(im_s * tmp)
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) < -0.0749999999999999972

   1. Initial program 54.3%

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

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. metadata-eval N/A

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

      4. fp-cancel-sub-sign-inv N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(\color{blue}{\mathsf{fma}\left(\frac{-1}{3}, {im}^{2}, -2\right)} \cdot im\right) \]

      8. unpow2 N/A

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

      9. lower-*.f64 81.6

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

   5. Applied rewrites 81.6%

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

   6. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\left(\frac{1}{2} + \frac{-1}{4} \cdot {re}^{2}\right)} \cdot \left(\mathsf{fma}\left(\frac{-1}{3}, im \cdot im, -2\right) \cdot im\right) \]
   7. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\left(\frac{-1}{4} \cdot {re}^{2} + \frac{1}{2}\right)} \cdot \left(\mathsf{fma}\left(\frac{-1}{3}, im \cdot im, -2\right) \cdot im\right) \]

      2. *-commutative N/A

         \[\leadsto \left(\color{blue}{{re}^{2} \cdot \frac{-1}{4}} + \frac{1}{2}\right) \cdot \left(\mathsf{fma}\left(\frac{-1}{3}, im \cdot im, -2\right) \cdot im\right) \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({re}^{2}, \frac{-1}{4}, \frac{1}{2}\right)} \cdot \left(\mathsf{fma}\left(\frac{-1}{3}, im \cdot im, -2\right) \cdot im\right) \]

      4. unpow2 N/A

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

      5. lower-*.f64 49.8

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

   8. Applied rewrites 49.8%

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

   if -0.0749999999999999972 < (*.f64 #s(literal 1/2 binary64) (cos.f64 re))

   1. Initial program 55.1%

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

   3. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

      3. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \cdot \frac{1}{2} \]

      4. lower-exp.f64 N/A

         \[\leadsto \left(\color{blue}{e^{\mathsf{neg}\left(im\right)}} - e^{im}\right) \cdot \frac{1}{2} \]

      5. lower-neg.f64 N/A

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

      6. lower-exp.f64 54.9

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

   5. Applied rewrites 54.9%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 79.3%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.0001984126984126984, im \cdot im, -0.008333333333333333\right), im \cdot im, -0.16666666666666666\right), im \cdot im, -1\right) \cdot \color{blue}{im} \]

   9. Taylor expanded in im around inf

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{5040} \cdot {im}^{2}, im \cdot im, \frac{-1}{6}\right), im \cdot im, -1\right) \cdot im \]
   10. Step-by-step derivation

   11. Applied rewrites 79.3%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(-0.0001984126984126984 \cdot \left(im \cdot im\right), im \cdot im, -0.16666666666666666\right), im \cdot im, -1\right) \cdot im \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 13: 69.0% accurate, 2.2× 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}\;0.5 \cdot \cos re \leq -0.075:\\ \;\;\;\;\mathsf{fma}\left(re \cdot re, -0.25, 0.5\right) \cdot \left(\mathsf{fma}\left(-0.3333333333333333, im\_m \cdot im\_m, -2\right) \cdot im\_m\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-0.008333333333333333, im\_m \cdot im\_m, -0.16666666666666666\right), im\_m \cdot im\_m, -1\right) \cdot im\_m\\ \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= (* 0.5 (cos re)) -0.075)
    (*
     (fma (* re re) -0.25 0.5)
     (* (fma -0.3333333333333333 (* im_m im_m) -2.0) im_m))
    (*
     (fma
      (fma -0.008333333333333333 (* im_m im_m) -0.16666666666666666)
      (* im_m im_m)
      -1.0)
     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 ((0.5 * cos(re)) <= -0.075) {
		tmp = fma((re * re), -0.25, 0.5) * (fma(-0.3333333333333333, (im_m * im_m), -2.0) * im_m);
	} else {
		tmp = fma(fma(-0.008333333333333333, (im_m * im_m), -0.16666666666666666), (im_m * im_m), -1.0) * 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 (Float64(0.5 * cos(re)) <= -0.075)
		tmp = Float64(fma(Float64(re * re), -0.25, 0.5) * Float64(fma(-0.3333333333333333, Float64(im_m * im_m), -2.0) * im_m));
	else
		tmp = Float64(fma(fma(-0.008333333333333333, Float64(im_m * im_m), -0.16666666666666666), Float64(im_m * im_m), -1.0) * im_m);
	end
	return Float64(im_s * tmp)
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) < -0.0749999999999999972

   1. Initial program 54.3%

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

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. metadata-eval N/A

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

      4. fp-cancel-sub-sign-inv N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

         \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(\color{blue}{\mathsf{fma}\left(\frac{-1}{3}, {im}^{2}, -2\right)} \cdot im\right) \]

      8. unpow2 N/A

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

      9. lower-*.f64 81.6

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

   5. Applied rewrites 81.6%

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

   6. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\left(\frac{1}{2} + \frac{-1}{4} \cdot {re}^{2}\right)} \cdot \left(\mathsf{fma}\left(\frac{-1}{3}, im \cdot im, -2\right) \cdot im\right) \]
   7. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\left(\frac{-1}{4} \cdot {re}^{2} + \frac{1}{2}\right)} \cdot \left(\mathsf{fma}\left(\frac{-1}{3}, im \cdot im, -2\right) \cdot im\right) \]

      2. *-commutative N/A

         \[\leadsto \left(\color{blue}{{re}^{2} \cdot \frac{-1}{4}} + \frac{1}{2}\right) \cdot \left(\mathsf{fma}\left(\frac{-1}{3}, im \cdot im, -2\right) \cdot im\right) \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({re}^{2}, \frac{-1}{4}, \frac{1}{2}\right)} \cdot \left(\mathsf{fma}\left(\frac{-1}{3}, im \cdot im, -2\right) \cdot im\right) \]

      4. unpow2 N/A

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

      5. lower-*.f64 49.8

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

   8. Applied rewrites 49.8%

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

   if -0.0749999999999999972 < (*.f64 #s(literal 1/2 binary64) (cos.f64 re))

   1. Initial program 55.1%

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

   3. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

      3. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \cdot \frac{1}{2} \]

      4. lower-exp.f64 N/A

         \[\leadsto \left(\color{blue}{e^{\mathsf{neg}\left(im\right)}} - e^{im}\right) \cdot \frac{1}{2} \]

      5. lower-neg.f64 N/A

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

      6. lower-exp.f64 54.9

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

   5. Applied rewrites 54.9%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 75.0%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(-0.008333333333333333, im \cdot im, -0.16666666666666666\right), im \cdot im, -1\right) \cdot \color{blue}{im} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 14: 67.2% accurate, 2.3× 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}\;0.5 \cdot \cos re \leq -0.075:\\ \;\;\;\;\mathsf{fma}\left(re \cdot re, 0.5, -1\right) \cdot im\_m\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-0.008333333333333333, im\_m \cdot im\_m, -0.16666666666666666\right), im\_m \cdot im\_m, -1\right) \cdot im\_m\\ \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= (* 0.5 (cos re)) -0.075)
    (* (fma (* re re) 0.5 -1.0) im_m)
    (*
     (fma
      (fma -0.008333333333333333 (* im_m im_m) -0.16666666666666666)
      (* im_m im_m)
      -1.0)
     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 ((0.5 * cos(re)) <= -0.075) {
		tmp = fma((re * re), 0.5, -1.0) * im_m;
	} else {
		tmp = fma(fma(-0.008333333333333333, (im_m * im_m), -0.16666666666666666), (im_m * im_m), -1.0) * 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 (Float64(0.5 * cos(re)) <= -0.075)
		tmp = Float64(fma(Float64(re * re), 0.5, -1.0) * im_m);
	else
		tmp = Float64(fma(fma(-0.008333333333333333, Float64(im_m * im_m), -0.16666666666666666), Float64(im_m * im_m), -1.0) * im_m);
	end
	return Float64(im_s * tmp)
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) < -0.0749999999999999972

   1. Initial program 54.3%

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

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-cos.f64 51.1

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

   5. Applied rewrites 51.1%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 42.4%

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

   if -0.0749999999999999972 < (*.f64 #s(literal 1/2 binary64) (cos.f64 re))

   1. Initial program 55.1%

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

   3. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

      3. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \cdot \frac{1}{2} \]

      4. lower-exp.f64 N/A

         \[\leadsto \left(\color{blue}{e^{\mathsf{neg}\left(im\right)}} - e^{im}\right) \cdot \frac{1}{2} \]

      5. lower-neg.f64 N/A

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

      6. lower-exp.f64 54.9

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

   5. Applied rewrites 54.9%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 75.0%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(-0.008333333333333333, im \cdot im, -0.16666666666666666\right), im \cdot im, -1\right) \cdot \color{blue}{im} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 15: 62.2% accurate, 2.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}\;0.5 \cdot \cos re \leq -0.075:\\ \;\;\;\;\mathsf{fma}\left(re \cdot re, 0.5, -1\right) \cdot im\_m\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-0.16666666666666666 \cdot \left(im\_m \cdot im\_m\right), im\_m, -im\_m\right)\\ \end{array} \end{array} \]

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= (* 0.5 (cos re)) -0.075)
    (* (fma (* re re) 0.5 -1.0) im_m)
    (fma (* -0.16666666666666666 (* im_m im_m)) im_m (- 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 ((0.5 * cos(re)) <= -0.075) {
		tmp = fma((re * re), 0.5, -1.0) * im_m;
	} else {
		tmp = fma((-0.16666666666666666 * (im_m * im_m)), im_m, -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 (Float64(0.5 * cos(re)) <= -0.075)
		tmp = Float64(fma(Float64(re * re), 0.5, -1.0) * im_m);
	else
		tmp = fma(Float64(-0.16666666666666666 * Float64(im_m * im_m)), im_m, Float64(-im_m));
	end
	return Float64(im_s * tmp)
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) < -0.0749999999999999972

   1. Initial program 54.3%

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

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-cos.f64 51.1

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

   5. Applied rewrites 51.1%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 42.4%

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

   if -0.0749999999999999972 < (*.f64 #s(literal 1/2 binary64) (cos.f64 re))

   1. Initial program 55.1%

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

   3. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

      3. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \cdot \frac{1}{2} \]

      4. lower-exp.f64 N/A

         \[\leadsto \left(\color{blue}{e^{\mathsf{neg}\left(im\right)}} - e^{im}\right) \cdot \frac{1}{2} \]

      5. lower-neg.f64 N/A

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

      6. lower-exp.f64 54.9

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

   5. Applied rewrites 54.9%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 66.5%

      \[\leadsto \mathsf{fma}\left(im \cdot im, -0.16666666666666666, -1\right) \cdot \color{blue}{im} \]
   9. Step-by-step derivation

   10. Applied rewrites 66.5%

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

4. Final simplification 60.6%

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

Alternative 16: 62.2% accurate, 2.5× speedup

Math

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

FPCore

im\_m = (fabs.f64 im)
im\_s = (copysign.f64 #s(literal 1 binary64) im)
(FPCore (im_s re im_m)
 :precision binary64
 (*
  im_s
  (if (<= (* 0.5 (cos re)) -0.075)
    (* (fma (* re re) 0.5 -1.0) im_m)
    (* (fma (* -0.16666666666666666 im_m) im_m -1.0) 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 ((0.5 * cos(re)) <= -0.075) {
		tmp = fma((re * re), 0.5, -1.0) * im_m;
	} else {
		tmp = fma((-0.16666666666666666 * im_m), im_m, -1.0) * 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 (Float64(0.5 * cos(re)) <= -0.075)
		tmp = Float64(fma(Float64(re * re), 0.5, -1.0) * im_m);
	else
		tmp = Float64(fma(Float64(-0.16666666666666666 * im_m), im_m, -1.0) * im_m);
	end
	return Float64(im_s * tmp)
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) < -0.0749999999999999972

   1. Initial program 54.3%

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

   3. Taylor expanded in im around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-cos.f64 51.1

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

   5. Applied rewrites 51.1%

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

   6. Taylor expanded in re around 0

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

   8. Applied rewrites 42.4%

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

   if -0.0749999999999999972 < (*.f64 #s(literal 1/2 binary64) (cos.f64 re))

   1. Initial program 55.1%

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

   3. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

      3. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \cdot \frac{1}{2} \]

      4. lower-exp.f64 N/A

         \[\leadsto \left(\color{blue}{e^{\mathsf{neg}\left(im\right)}} - e^{im}\right) \cdot \frac{1}{2} \]

      5. lower-neg.f64 N/A

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

      6. lower-exp.f64 54.9

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

   5. Applied rewrites 54.9%

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

   6. Taylor expanded in im around 0

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

   8. Applied rewrites 66.5%

      \[\leadsto \mathsf{fma}\left(im \cdot im, -0.16666666666666666, -1\right) \cdot \color{blue}{im} \]
   9. Step-by-step derivation

   10. Applied rewrites 66.5%

       \[\leadsto \mathsf{fma}\left(-0.16666666666666666 \cdot im, im, -1\right) \cdot im \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 17: 53.3% accurate, 18.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 54.9%

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

3. Taylor expanded in re around 0

   \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \]
4. Step-by-step derivation

   1. *-commutative N/A

      \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

   2. lower-*.f64 N/A

      \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right) \cdot \frac{1}{2}} \]

   3. lower--.f64 N/A

      \[\leadsto \color{blue}{\left(e^{\mathsf{neg}\left(im\right)} - e^{im}\right)} \cdot \frac{1}{2} \]

   4. lower-exp.f64 N/A

      \[\leadsto \left(\color{blue}{e^{\mathsf{neg}\left(im\right)}} - e^{im}\right) \cdot \frac{1}{2} \]

   5. lower-neg.f64 N/A

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

   6. lower-exp.f64 42.0

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

5. Applied rewrites 42.0%

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

6. Taylor expanded in im around 0

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

8. Applied rewrites 50.5%

   \[\leadsto \mathsf{fma}\left(im \cdot im, -0.16666666666666666, -1\right) \cdot \color{blue}{im} \]
9. Step-by-step derivation

10. Applied rewrites 50.5%

    \[\leadsto \mathsf{fma}\left(-0.16666666666666666 \cdot im, im, -1\right) \cdot im \]
11. Add Preprocessing

Alternative 18: 29.7% accurate, 28.8× speedup

Math

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

FPCore

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

C

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

Fortran

im\_m =     private
im\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(im_s, re, im_m)
use fmin_fmax_functions
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    code = im_s * (0.5d0 * ((-2.0d0) * im_m))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 54.9%

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

3. Taylor expanded in im around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. metadata-eval N/A

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

   4. fp-cancel-sub-sign-inv N/A

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

   5. metadata-eval N/A

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

   6. metadata-eval N/A

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

   7. lower-fma.f64 N/A

      \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(\color{blue}{\mathsf{fma}\left(\frac{-1}{3}, {im}^{2}, -2\right)} \cdot im\right) \]

   8. unpow2 N/A

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

   9. lower-*.f64 80.6

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

5. Applied rewrites 80.6%

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

7. Applied rewrites 80.6%

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

8. Taylor expanded in re around 0

   \[\leadsto \color{blue}{\frac{1}{2}} \cdot \mathsf{fma}\left(\frac{-1}{3} \cdot \left(im \cdot im\right), im, -2 \cdot im\right) \]
9. Step-by-step derivation

10. Applied rewrites 50.5%

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

11. Taylor expanded in im around 0

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

13. Applied rewrites 29.0%

    \[\leadsto 0.5 \cdot \left(-2 \cdot \color{blue}{im}\right) \]
14. Add Preprocessing

Alternative 19: 29.7% accurate, 105.7× speedup

Math

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

FPCore

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

C

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

Fortran

im\_m =     private
im\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(im_s, re, im_m)
use fmin_fmax_functions
    real(8), intent (in) :: im_s
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    code = im_s * -im_m
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 54.9%

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

3. Taylor expanded in im around 0

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

   1. *-commutative N/A

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

   2. associate-*r* N/A

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

   3. lower-*.f64 N/A

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

   4. mul-1-neg N/A

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

   5. lower-neg.f64 N/A

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

   6. lower-cos.f64 51.2

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

5. Applied rewrites 51.2%

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

6. Taylor expanded in re around 0

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

8. Applied rewrites 28.7%

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

Developer Target 1: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(re, im)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if (abs(im) < 1.0d0) then
        tmp = -(cos(re) * ((im + (((0.16666666666666666d0 * im) * im) * im)) + (((((0.008333333333333333d0 * im) * im) * im) * im) * im)))
    else
        tmp = (0.5d0 * cos(re)) * (exp((0.0d0 - im)) - exp(im))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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

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

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