math.sin on complex, real part

Percentage Accurate: 100.0% → 100.0%

Time: 6.7s

Alternatives: 10

Speedup: 1.0×

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. distribute-rgt-in 100.0%

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

   2. cancel-sign-sub 100.0%

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

   3. distribute-rgt-out-- 100.0%

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

   4. sub-neg 100.0%

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

   5. remove-double-neg 100.0%

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

   6. neg-sub0 100.0%

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

3. Simplified 100.0%

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

5. Final simplification 100.0%

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

Alternative 2: 86.5% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;im \leq 6.8 \cdot 10^{-7}:\\ \;\;\;\;\left(0.5 \cdot \sin re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\ \mathbf{elif}\;im \leq 10^{+48}:\\ \;\;\;\;\left(e^{-im} + e^{im}\right) \cdot \left(0.5 \cdot re\right)\\ \mathbf{else}:\\ \;\;\;\;\sin re \cdot \left(0.001388888888888889 \cdot {im}^{6}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= im 6.8e-7)
   (* (* 0.5 (sin re)) (fma im im 2.0))
   (if (<= im 1e+48)
     (* (+ (exp (- im)) (exp im)) (* 0.5 re))
     (* (sin re) (* 0.001388888888888889 (pow im 6.0))))))

C

double code(double re, double im) {
	double tmp;
	if (im <= 6.8e-7) {
		tmp = (0.5 * sin(re)) * fma(im, im, 2.0);
	} else if (im <= 1e+48) {
		tmp = (exp(-im) + exp(im)) * (0.5 * re);
	} else {
		tmp = sin(re) * (0.001388888888888889 * pow(im, 6.0));
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (im <= 6.8e-7)
		tmp = Float64(Float64(0.5 * sin(re)) * fma(im, im, 2.0));
	elseif (im <= 1e+48)
		tmp = Float64(Float64(exp(Float64(-im)) + exp(im)) * Float64(0.5 * re));
	else
		tmp = Float64(sin(re) * Float64(0.001388888888888889 * (im ^ 6.0)));
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[im, 6.8e-7], N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[im, 1e+48], N[(N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision] * N[(0.5 * re), $MachinePrecision]), $MachinePrecision], N[(N[Sin[re], $MachinePrecision] * N[(0.001388888888888889 * N[Power[im, 6.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if im < 6.79999999999999948e-7

   1. Initial program 100.0%

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

      1. distribute-rgt-in 100.0%

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

      2. cancel-sign-sub 100.0%

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

      3. distribute-rgt-out-- 100.0%

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

      4. sub-neg 100.0%

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

      5. remove-double-neg 100.0%

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

      6. neg-sub0 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in im around 0 81.3%

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

      1. +-commutative 81.3%

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

      2. unpow2 81.3%

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

      3. fma-define 81.3%

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

   7. Simplified 81.3%

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

   if 6.79999999999999948e-7 < im < 1.00000000000000004e48

   1. Initial program 99.8%

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

      1. distribute-rgt-in 99.5%

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

      2. cancel-sign-sub 99.5%

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

      3. distribute-rgt-out-- 99.8%

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

      4. sub-neg 99.8%

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

      5. remove-double-neg 99.8%

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

      6. neg-sub0 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in re around 0 55.5%

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

   if 1.00000000000000004e48 < im

   1. Initial program 100.0%

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

      1. distribute-rgt-in 100.0%

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

      2. cancel-sign-sub 100.0%

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

      3. distribute-rgt-out-- 100.0%

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

      4. sub-neg 100.0%

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

      5. remove-double-neg 100.0%

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

      6. neg-sub0 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in im around 0 98.2%

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

      1. *-commutative 98.2%

         \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(2 + {im}^{2} \cdot \left(1 + {im}^{2} \cdot \left(0.08333333333333333 + \color{blue}{{im}^{2} \cdot 0.002777777777777778}\right)\right)\right) \]

   7. Simplified 98.2%

      \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \color{blue}{\left(2 + {im}^{2} \cdot \left(1 + {im}^{2} \cdot \left(0.08333333333333333 + {im}^{2} \cdot 0.002777777777777778\right)\right)\right)} \]

   8. Taylor expanded in im around inf 98.2%

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

      1. associate-*r* 98.2%

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

      2. *-commutative 98.2%

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

   10. Simplified 98.2%

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

4. Final simplification 83.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 6.8 \cdot 10^{-7}:\\ \;\;\;\;\left(0.5 \cdot \sin re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\ \mathbf{elif}\;im \leq 10^{+48}:\\ \;\;\;\;\left(e^{-im} + e^{im}\right) \cdot \left(0.5 \cdot re\right)\\ \mathbf{else}:\\ \;\;\;\;\sin re \cdot \left(0.001388888888888889 \cdot {im}^{6}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 71.8% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;im \leq 37000000000:\\ \;\;\;\;\sin re\\ \mathbf{elif}\;im \leq 10^{+48}:\\ \;\;\;\;{re}^{-1716}\\ \mathbf{else}:\\ \;\;\;\;\sin re \cdot \left(0.001388888888888889 \cdot {im}^{6}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= im 37000000000.0)
   (sin re)
   (if (<= im 1e+48)
     (pow re -1716.0)
     (* (sin re) (* 0.001388888888888889 (pow im 6.0))))))

C

double code(double re, double im) {
	double tmp;
	if (im <= 37000000000.0) {
		tmp = sin(re);
	} else if (im <= 1e+48) {
		tmp = pow(re, -1716.0);
	} else {
		tmp = sin(re) * (0.001388888888888889 * pow(im, 6.0));
	}
	return tmp;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if (im <= 37000000000.0d0) then
        tmp = sin(re)
    else if (im <= 1d+48) then
        tmp = re ** (-1716.0d0)
    else
        tmp = sin(re) * (0.001388888888888889d0 * (im ** 6.0d0))
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (im <= 37000000000.0) {
		tmp = Math.sin(re);
	} else if (im <= 1e+48) {
		tmp = Math.pow(re, -1716.0);
	} else {
		tmp = Math.sin(re) * (0.001388888888888889 * Math.pow(im, 6.0));
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if im <= 37000000000.0:
		tmp = math.sin(re)
	elif im <= 1e+48:
		tmp = math.pow(re, -1716.0)
	else:
		tmp = math.sin(re) * (0.001388888888888889 * math.pow(im, 6.0))
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (im <= 37000000000.0)
		tmp = sin(re);
	elseif (im <= 1e+48)
		tmp = re ^ -1716.0;
	else
		tmp = Float64(sin(re) * Float64(0.001388888888888889 * (im ^ 6.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (im <= 37000000000.0)
		tmp = sin(re);
	elseif (im <= 1e+48)
		tmp = re ^ -1716.0;
	else
		tmp = sin(re) * (0.001388888888888889 * (im ^ 6.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[im, 37000000000.0], N[Sin[re], $MachinePrecision], If[LessEqual[im, 1e+48], N[Power[re, -1716.0], $MachinePrecision], N[(N[Sin[re], $MachinePrecision] * N[(0.001388888888888889 * N[Power[im, 6.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if im < 3.7e10

   1. Initial program 100.0%

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

      1. distribute-rgt-in 99.9%

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

      2. cancel-sign-sub 99.9%

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

      3. distribute-rgt-out-- 100.0%

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

      4. sub-neg 100.0%

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

      5. remove-double-neg 100.0%

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

      6. neg-sub0 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in im around 0 63.5%

      \[\leadsto \color{blue}{\sin re} \]

   if 3.7e10 < im < 1.00000000000000004e48

   1. Initial program 100.0%

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

      1. distribute-rgt-in 100.0%

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

      2. cancel-sign-sub 100.0%

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

      3. distribute-rgt-out-- 100.0%

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

      4. sub-neg 100.0%

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

      5. remove-double-neg 100.0%

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

      6. neg-sub0 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in re around 0 60.0%

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

   7. Applied egg-rr 20.6%

      \[\leadsto \color{blue}{{re}^{-1716}} \]

   if 1.00000000000000004e48 < im

   1. Initial program 100.0%

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

      1. distribute-rgt-in 100.0%

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

      2. cancel-sign-sub 100.0%

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

      3. distribute-rgt-out-- 100.0%

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

      4. sub-neg 100.0%

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

      5. remove-double-neg 100.0%

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

      6. neg-sub0 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in im around 0 98.2%

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

      1. *-commutative 98.2%

         \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(2 + {im}^{2} \cdot \left(1 + {im}^{2} \cdot \left(0.08333333333333333 + \color{blue}{{im}^{2} \cdot 0.002777777777777778}\right)\right)\right) \]

   7. Simplified 98.2%

      \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \color{blue}{\left(2 + {im}^{2} \cdot \left(1 + {im}^{2} \cdot \left(0.08333333333333333 + {im}^{2} \cdot 0.002777777777777778\right)\right)\right)} \]

   8. Taylor expanded in im around inf 98.2%

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

      1. associate-*r* 98.2%

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

      2. *-commutative 98.2%

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

   10. Simplified 98.2%

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

4. Final simplification 69.4%

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

Alternative 4: 84.5% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;im \leq 37000000000:\\ \;\;\;\;\left(0.5 \cdot \sin re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\ \mathbf{elif}\;im \leq 10^{+48}:\\ \;\;\;\;{re}^{-1716}\\ \mathbf{else}:\\ \;\;\;\;\sin re \cdot \left(0.001388888888888889 \cdot {im}^{6}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= im 37000000000.0)
   (* (* 0.5 (sin re)) (fma im im 2.0))
   (if (<= im 1e+48)
     (pow re -1716.0)
     (* (sin re) (* 0.001388888888888889 (pow im 6.0))))))

C

double code(double re, double im) {
	double tmp;
	if (im <= 37000000000.0) {
		tmp = (0.5 * sin(re)) * fma(im, im, 2.0);
	} else if (im <= 1e+48) {
		tmp = pow(re, -1716.0);
	} else {
		tmp = sin(re) * (0.001388888888888889 * pow(im, 6.0));
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (im <= 37000000000.0)
		tmp = Float64(Float64(0.5 * sin(re)) * fma(im, im, 2.0));
	elseif (im <= 1e+48)
		tmp = re ^ -1716.0;
	else
		tmp = Float64(sin(re) * Float64(0.001388888888888889 * (im ^ 6.0)));
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[im, 37000000000.0], N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[im, 1e+48], N[Power[re, -1716.0], $MachinePrecision], N[(N[Sin[re], $MachinePrecision] * N[(0.001388888888888889 * N[Power[im, 6.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if im < 3.7e10

   1. Initial program 100.0%

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

      1. distribute-rgt-in 99.9%

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

      2. cancel-sign-sub 99.9%

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

      3. distribute-rgt-out-- 100.0%

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

      4. sub-neg 100.0%

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

      5. remove-double-neg 100.0%

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

      6. neg-sub0 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in im around 0 80.0%

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

      1. +-commutative 80.0%

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

      2. unpow2 80.0%

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

      3. fma-define 80.0%

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

   7. Simplified 80.0%

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

   if 3.7e10 < im < 1.00000000000000004e48

   1. Initial program 100.0%

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

      1. distribute-rgt-in 100.0%

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

      2. cancel-sign-sub 100.0%

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

      3. distribute-rgt-out-- 100.0%

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

      4. sub-neg 100.0%

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

      5. remove-double-neg 100.0%

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

      6. neg-sub0 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in re around 0 60.0%

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

   7. Applied egg-rr 20.6%

      \[\leadsto \color{blue}{{re}^{-1716}} \]

   if 1.00000000000000004e48 < im

   1. Initial program 100.0%

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

      1. distribute-rgt-in 100.0%

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

      2. cancel-sign-sub 100.0%

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

      3. distribute-rgt-out-- 100.0%

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

      4. sub-neg 100.0%

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

      5. remove-double-neg 100.0%

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

      6. neg-sub0 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in im around 0 98.2%

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

      1. *-commutative 98.2%

         \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(2 + {im}^{2} \cdot \left(1 + {im}^{2} \cdot \left(0.08333333333333333 + \color{blue}{{im}^{2} \cdot 0.002777777777777778}\right)\right)\right) \]

   7. Simplified 98.2%

      \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \color{blue}{\left(2 + {im}^{2} \cdot \left(1 + {im}^{2} \cdot \left(0.08333333333333333 + {im}^{2} \cdot 0.002777777777777778\right)\right)\right)} \]

   8. Taylor expanded in im around inf 98.2%

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

      1. associate-*r* 98.2%

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

      2. *-commutative 98.2%

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

   10. Simplified 98.2%

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

4. Final simplification 82.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 37000000000:\\ \;\;\;\;\left(0.5 \cdot \sin re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\ \mathbf{elif}\;im \leq 10^{+48}:\\ \;\;\;\;{re}^{-1716}\\ \mathbf{else}:\\ \;\;\;\;\sin re \cdot \left(0.001388888888888889 \cdot {im}^{6}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 66.7% accurate, 2.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;im \leq 37000000000:\\ \;\;\;\;\sin re\\ \mathbf{elif}\;im \leq 1.4 \cdot 10^{+55}:\\ \;\;\;\;{re}^{-1716}\\ \mathbf{else}:\\ \;\;\;\;0.001388888888888889 \cdot \left(re \cdot {im}^{6}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= im 37000000000.0)
   (sin re)
   (if (<= im 1.4e+55)
     (pow re -1716.0)
     (* 0.001388888888888889 (* re (pow im 6.0))))))

C

double code(double re, double im) {
	double tmp;
	if (im <= 37000000000.0) {
		tmp = sin(re);
	} else if (im <= 1.4e+55) {
		tmp = pow(re, -1716.0);
	} else {
		tmp = 0.001388888888888889 * (re * pow(im, 6.0));
	}
	return tmp;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if (im <= 37000000000.0d0) then
        tmp = sin(re)
    else if (im <= 1.4d+55) then
        tmp = re ** (-1716.0d0)
    else
        tmp = 0.001388888888888889d0 * (re * (im ** 6.0d0))
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (im <= 37000000000.0) {
		tmp = Math.sin(re);
	} else if (im <= 1.4e+55) {
		tmp = Math.pow(re, -1716.0);
	} else {
		tmp = 0.001388888888888889 * (re * Math.pow(im, 6.0));
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if im <= 37000000000.0:
		tmp = math.sin(re)
	elif im <= 1.4e+55:
		tmp = math.pow(re, -1716.0)
	else:
		tmp = 0.001388888888888889 * (re * math.pow(im, 6.0))
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (im <= 37000000000.0)
		tmp = sin(re);
	elseif (im <= 1.4e+55)
		tmp = re ^ -1716.0;
	else
		tmp = Float64(0.001388888888888889 * Float64(re * (im ^ 6.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (im <= 37000000000.0)
		tmp = sin(re);
	elseif (im <= 1.4e+55)
		tmp = re ^ -1716.0;
	else
		tmp = 0.001388888888888889 * (re * (im ^ 6.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[im, 37000000000.0], N[Sin[re], $MachinePrecision], If[LessEqual[im, 1.4e+55], N[Power[re, -1716.0], $MachinePrecision], N[(0.001388888888888889 * N[(re * N[Power[im, 6.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if im < 3.7e10

   1. Initial program 100.0%

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

      1. distribute-rgt-in 99.9%

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

      2. cancel-sign-sub 99.9%

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

      3. distribute-rgt-out-- 100.0%

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

      4. sub-neg 100.0%

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

      5. remove-double-neg 100.0%

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

      6. neg-sub0 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in im around 0 63.5%

      \[\leadsto \color{blue}{\sin re} \]

   if 3.7e10 < im < 1.4e55

   1. Initial program 100.0%

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

      1. distribute-rgt-in 100.0%

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

      2. cancel-sign-sub 100.0%

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

      3. distribute-rgt-out-- 100.0%

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

      4. sub-neg 100.0%

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

      5. remove-double-neg 100.0%

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

      6. neg-sub0 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in re around 0 50.0%

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

   7. Applied egg-rr 25.8%

      \[\leadsto \color{blue}{{re}^{-1716}} \]

   if 1.4e55 < im

   1. Initial program 100.0%

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

      1. distribute-rgt-in 100.0%

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

      2. cancel-sign-sub 100.0%

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

      3. distribute-rgt-out-- 100.0%

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

      4. sub-neg 100.0%

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

      5. remove-double-neg 100.0%

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

      6. neg-sub0 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in im around 0 100.0%

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

      1. *-commutative 100.0%

         \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(2 + {im}^{2} \cdot \left(1 + {im}^{2} \cdot \left(0.08333333333333333 + \color{blue}{{im}^{2} \cdot 0.002777777777777778}\right)\right)\right) \]

   7. Simplified 100.0%

      \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \color{blue}{\left(2 + {im}^{2} \cdot \left(1 + {im}^{2} \cdot \left(0.08333333333333333 + {im}^{2} \cdot 0.002777777777777778\right)\right)\right)} \]

   8. Taylor expanded in re around 0 80.9%

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

   9. Taylor expanded in im around inf 80.9%

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

4. Final simplification 65.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 37000000000:\\ \;\;\;\;\sin re\\ \mathbf{elif}\;im \leq 1.4 \cdot 10^{+55}:\\ \;\;\;\;{re}^{-1716}\\ \mathbf{else}:\\ \;\;\;\;0.001388888888888889 \cdot \left(re \cdot {im}^{6}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 56.7% accurate, 2.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;im \leq 37000000000:\\ \;\;\;\;\sin re\\ \mathbf{else}:\\ \;\;\;\;{re}^{-1716}\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= im 37000000000.0) (sin re) (pow re -1716.0)))

C

double code(double re, double im) {
	double tmp;
	if (im <= 37000000000.0) {
		tmp = sin(re);
	} else {
		tmp = pow(re, -1716.0);
	}
	return tmp;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if (im <= 37000000000.0d0) then
        tmp = sin(re)
    else
        tmp = re ** (-1716.0d0)
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (im <= 37000000000.0) {
		tmp = Math.sin(re);
	} else {
		tmp = Math.pow(re, -1716.0);
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if im <= 37000000000.0:
		tmp = math.sin(re)
	else:
		tmp = math.pow(re, -1716.0)
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (im <= 37000000000.0)
		tmp = sin(re);
	else
		tmp = re ^ -1716.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (im <= 37000000000.0)
		tmp = sin(re);
	else
		tmp = re ^ -1716.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[im, 37000000000.0], N[Sin[re], $MachinePrecision], N[Power[re, -1716.0], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if im < 3.7e10

   1. Initial program 100.0%

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

      1. distribute-rgt-in 99.9%

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

      2. cancel-sign-sub 99.9%

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

      3. distribute-rgt-out-- 100.0%

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

      4. sub-neg 100.0%

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

      5. remove-double-neg 100.0%

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

      6. neg-sub0 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in im around 0 63.5%

      \[\leadsto \color{blue}{\sin re} \]

   if 3.7e10 < im

   1. Initial program 100.0%

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

      1. distribute-rgt-in 100.0%

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

      2. cancel-sign-sub 100.0%

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

      3. distribute-rgt-out-- 100.0%

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

      4. sub-neg 100.0%

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

      5. remove-double-neg 100.0%

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

      6. neg-sub0 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in re around 0 76.4%

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

   7. Applied egg-rr 31.6%

      \[\leadsto \color{blue}{{re}^{-1716}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 56.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 37000000000:\\ \;\;\;\;\sin re\\ \mathbf{else}:\\ \;\;\;\;{re}^{-1716}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 51.8% accurate, 3.1× speedup

Math

\[\begin{array}{l} \\ \sin re \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (sin re))

C

double code(double re, double im) {
	return sin(re);
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = sin(re)
end function

Java

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

Python

def code(re, im):
	return math.sin(re)

Julia

function code(re, im)
	return sin(re)
end

MATLAB

function tmp = code(re, im)
	tmp = sin(re);
end

Wolfram

code[re_, im_] := N[Sin[re], $MachinePrecision]

Derivation

1. Initial program 100.0%

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

   1. distribute-rgt-in 100.0%

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

   2. cancel-sign-sub 100.0%

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

   3. distribute-rgt-out-- 100.0%

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

   4. sub-neg 100.0%

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

   5. remove-double-neg 100.0%

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

   6. neg-sub0 100.0%

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

3. Simplified 100.0%

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

5. Taylor expanded in im around 0 50.4%

   \[\leadsto \color{blue}{\sin re} \]

6. Final simplification 50.4%

   \[\leadsto \sin re \]
7. Add Preprocessing

Alternative 8: 27.9% accurate, 51.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq 27.5:\\ \;\;\;\;re\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (if (<= re 27.5) re 1.0))

C

double code(double re, double im) {
	double tmp;
	if (re <= 27.5) {
		tmp = re;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if (re <= 27.5d0) then
        tmp = re
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (re <= 27.5) {
		tmp = re;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if re <= 27.5:
		tmp = re
	else:
		tmp = 1.0
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (re <= 27.5)
		tmp = re;
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (re <= 27.5)
		tmp = re;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[re, 27.5], re, 1.0]

Derivation

1. Split input into 2 regimes

2. if re < 27.5

   1. Initial program 100.0%

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

      1. distribute-rgt-in 100.0%

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

      2. cancel-sign-sub 100.0%

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

      3. distribute-rgt-out-- 100.0%

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

      4. sub-neg 100.0%

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

      5. remove-double-neg 100.0%

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

      6. neg-sub0 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in re around 0 75.1%

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

   6. Taylor expanded in im around 0 31.2%

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

   if 27.5 < re

   1. Initial program 100.0%

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

      1. distribute-rgt-in 99.9%

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

      2. cancel-sign-sub 99.9%

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

      3. distribute-rgt-out-- 100.0%

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

      4. sub-neg 100.0%

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

      5. remove-double-neg 100.0%

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

      6. neg-sub0 100.0%

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

   3. Simplified 100.0%

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

   6. Applied egg-rr 6.9%

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

      1. +-inverses 6.9%

         \[\leadsto \frac{\sin re \cdot -2}{\sin re \cdot -2 + \color{blue}{0}} \]

      2. +-rgt-identity 6.9%

         \[\leadsto \frac{\sin re \cdot -2}{\color{blue}{\sin re \cdot -2}} \]

      3. *-inverses 6.9%

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

   8. Simplified 6.9%

      \[\leadsto \color{blue}{1} \]
3. Recombined 2 regimes into one program.

4. Final simplification 24.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;re \leq 27.5:\\ \;\;\;\;re\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 3.0% accurate, 309.0× speedup

Math

\[\begin{array}{l} \\ 0 \end{array} \]

FPCore

(FPCore (re im) :precision binary64 0.0)

C

double code(double re, double im) {
	return 0.0;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = 0.0d0
end function

Java

public static double code(double re, double im) {
	return 0.0;
}

Python

def code(re, im):
	return 0.0

Julia

function code(re, im)
	return 0.0
end

MATLAB

function tmp = code(re, im)
	tmp = 0.0;
end

Wolfram

code[re_, im_] := 0.0

Derivation

1. Initial program 100.0%

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

   1. distribute-rgt-in 100.0%

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

   2. cancel-sign-sub 100.0%

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

   3. distribute-rgt-out-- 100.0%

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

   4. sub-neg 100.0%

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

   5. remove-double-neg 100.0%

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

   6. neg-sub0 100.0%

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

3. Simplified 100.0%

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

6. Applied egg-rr 2.8%

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

   1. pow-base-1 2.8%

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

   2. metadata-eval 2.8%

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

8. Simplified 2.8%

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

9. Final simplification 2.8%

   \[\leadsto 0 \]
10. Add Preprocessing

Alternative 10: 4.8% accurate, 309.0× speedup

Math

\[\begin{array}{l} \\ 1 \end{array} \]

FPCore

(FPCore (re im) :precision binary64 1.0)

C

double code(double re, double im) {
	return 1.0;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = 1.0d0
end function

Java

public static double code(double re, double im) {
	return 1.0;
}

Python

def code(re, im):
	return 1.0

Julia

function code(re, im)
	return 1.0
end

MATLAB

function tmp = code(re, im)
	tmp = 1.0;
end

Wolfram

code[re_, im_] := 1.0

Derivation

1. Initial program 100.0%

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

   1. distribute-rgt-in 100.0%

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

   2. cancel-sign-sub 100.0%

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

   3. distribute-rgt-out-- 100.0%

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

   4. sub-neg 100.0%

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

   5. remove-double-neg 100.0%

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

   6. neg-sub0 100.0%

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

3. Simplified 100.0%

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

6. Applied egg-rr 5.0%

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

   1. +-inverses 5.0%

      \[\leadsto \frac{\sin re \cdot -2}{\sin re \cdot -2 + \color{blue}{0}} \]

   2. +-rgt-identity 5.0%

      \[\leadsto \frac{\sin re \cdot -2}{\color{blue}{\sin re \cdot -2}} \]

   3. *-inverses 5.0%

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

8. Simplified 5.0%

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

9. Final simplification 5.0%

   \[\leadsto 1 \]
10. Add Preprocessing

Reproduce

herbie shell --seed 2024077 
(FPCore (re im)
  :name "math.sin on complex, real part"
  :precision binary64
  (* (* 0.5 (sin re)) (+ (exp (- 0.0 im)) (exp im))))