math.sin on complex, real part

Percentage Accurate: 100.0% → 100.0%

Time: 6.0s

Alternatives: 18

Speedup: 1.0×

• 49.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. neg-sub0 100.0%

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

   6. remove-double-neg 100.0%

      \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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: 84.8% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;im \leq 0.07 \lor \neg \left(im \leq 1.35 \cdot 10^{+154}\right):\\ \;\;\;\;\left(0.5 \cdot \sin re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\ \mathbf{else}:\\ \;\;\;\;\left(0.5 \cdot re\right) \cdot \left(e^{-im} + e^{im}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (or (<= im 0.07) (not (<= im 1.35e+154)))
   (* (* 0.5 (sin re)) (fma im im 2.0))
   (* (* 0.5 re) (+ (exp (- im)) (exp im)))))

C

double code(double re, double im) {
	double tmp;
	if ((im <= 0.07) || !(im <= 1.35e+154)) {
		tmp = (0.5 * sin(re)) * fma(im, im, 2.0);
	} else {
		tmp = (0.5 * re) * (exp(-im) + exp(im));
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if ((im <= 0.07) || !(im <= 1.35e+154))
		tmp = Float64(Float64(0.5 * sin(re)) * fma(im, im, 2.0));
	else
		tmp = Float64(Float64(0.5 * re) * Float64(exp(Float64(-im)) + exp(im)));
	end
	return tmp
end

Wolfram

code[re_, im_] := If[Or[LessEqual[im, 0.07], N[Not[LessEqual[im, 1.35e+154]], $MachinePrecision]], N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 * re), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if im < 0.070000000000000007 or 1.35000000000000003e154 < 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. neg-sub0 100.0%

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

      6. remove-double-neg 100.0%

         \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 87.1%

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

   7. Simplified 87.1%

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

   if 0.070000000000000007 < im < 1.35000000000000003e154

   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. neg-sub0 100.0%

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

      6. remove-double-neg 100.0%

         \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 81.3%

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

   7. Simplified 81.3%

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

4. Final simplification 86.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 0.07 \lor \neg \left(im \leq 1.35 \cdot 10^{+154}\right):\\ \;\;\;\;\left(0.5 \cdot \sin re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\ \mathbf{else}:\\ \;\;\;\;\left(0.5 \cdot re\right) \cdot \left(e^{-im} + e^{im}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 77.2% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;im \leq 580 \lor \neg \left(im \leq 9.5 \cdot 10^{+146}\right):\\ \;\;\;\;\left(0.5 \cdot \sin re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\ \mathbf{else}:\\ \;\;\;\;{\left(\sin re \cdot -2\right)}^{-2}\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (or (<= im 580.0) (not (<= im 9.5e+146)))
   (* (* 0.5 (sin re)) (fma im im 2.0))
   (pow (* (sin re) -2.0) -2.0)))

C

double code(double re, double im) {
	double tmp;
	if ((im <= 580.0) || !(im <= 9.5e+146)) {
		tmp = (0.5 * sin(re)) * fma(im, im, 2.0);
	} else {
		tmp = pow((sin(re) * -2.0), -2.0);
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if ((im <= 580.0) || !(im <= 9.5e+146))
		tmp = Float64(Float64(0.5 * sin(re)) * fma(im, im, 2.0));
	else
		tmp = Float64(sin(re) * -2.0) ^ -2.0;
	end
	return tmp
end

Wolfram

code[re_, im_] := If[Or[LessEqual[im, 580.0], N[Not[LessEqual[im, 9.5e+146]], $MachinePrecision]], N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision], N[Power[N[(N[Sin[re], $MachinePrecision] * -2.0), $MachinePrecision], -2.0], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if im < 580 or 9.49999999999999926e146 < 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. neg-sub0 100.0%

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

      6. remove-double-neg 100.0%

         \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 84.8%

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

   7. Simplified 84.8%

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

   if 580 < im < 9.49999999999999926e146

   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. neg-sub0 100.0%

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

      6. remove-double-neg 100.0%

         \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 17.5%

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

4. Final simplification 78.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 580 \lor \neg \left(im \leq 9.5 \cdot 10^{+146}\right):\\ \;\;\;\;\left(0.5 \cdot \sin re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\ \mathbf{else}:\\ \;\;\;\;{\left(\sin re \cdot -2\right)}^{-2}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 61.5% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;im \leq 480:\\ \;\;\;\;\sin re\\ \mathbf{elif}\;im \leq 1.55 \cdot 10^{+125}:\\ \;\;\;\;{\left(\sin re \cdot -2\right)}^{-2}\\ \mathbf{else}:\\ \;\;\;\;re \cdot \left(1 + 0.5 \cdot {im}^{2}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= im 480.0)
   (sin re)
   (if (<= im 1.55e+125)
     (pow (* (sin re) -2.0) -2.0)
     (* re (+ 1.0 (* 0.5 (pow im 2.0)))))))

C

double code(double re, double im) {
	double tmp;
	if (im <= 480.0) {
		tmp = sin(re);
	} else if (im <= 1.55e+125) {
		tmp = pow((sin(re) * -2.0), -2.0);
	} else {
		tmp = re * (1.0 + (0.5 * pow(im, 2.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 <= 480.0d0) then
        tmp = sin(re)
    else if (im <= 1.55d+125) then
        tmp = (sin(re) * (-2.0d0)) ** (-2.0d0)
    else
        tmp = re * (1.0d0 + (0.5d0 * (im ** 2.0d0)))
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (im <= 480.0) {
		tmp = Math.sin(re);
	} else if (im <= 1.55e+125) {
		tmp = Math.pow((Math.sin(re) * -2.0), -2.0);
	} else {
		tmp = re * (1.0 + (0.5 * Math.pow(im, 2.0)));
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if im <= 480.0:
		tmp = math.sin(re)
	elif im <= 1.55e+125:
		tmp = math.pow((math.sin(re) * -2.0), -2.0)
	else:
		tmp = re * (1.0 + (0.5 * math.pow(im, 2.0)))
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (im <= 480.0)
		tmp = sin(re);
	elseif (im <= 1.55e+125)
		tmp = Float64(sin(re) * -2.0) ^ -2.0;
	else
		tmp = Float64(re * Float64(1.0 + Float64(0.5 * (im ^ 2.0))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (im <= 480.0)
		tmp = sin(re);
	elseif (im <= 1.55e+125)
		tmp = (sin(re) * -2.0) ^ -2.0;
	else
		tmp = re * (1.0 + (0.5 * (im ^ 2.0)));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[im, 480.0], N[Sin[re], $MachinePrecision], If[LessEqual[im, 1.55e+125], N[Power[N[(N[Sin[re], $MachinePrecision] * -2.0), $MachinePrecision], -2.0], $MachinePrecision], N[(re * N[(1.0 + N[(0.5 * N[Power[im, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if im < 480

   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. neg-sub0 100.0%

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

      6. remove-double-neg 100.0%

         \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 66.6%

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

   if 480 < im < 1.55e125

   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. neg-sub0 100.0%

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

      6. remove-double-neg 100.0%

         \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 19.9%

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

   if 1.55e125 < 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. neg-sub0 100.0%

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

      6. remove-double-neg 100.0%

         \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 79.2%

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

   7. Simplified 79.2%

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

   8. Taylor expanded in re around 0 59.7%

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

4. Final simplification 61.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 480:\\ \;\;\;\;\sin re\\ \mathbf{elif}\;im \leq 1.55 \cdot 10^{+125}:\\ \;\;\;\;{\left(\sin re \cdot -2\right)}^{-2}\\ \mathbf{else}:\\ \;\;\;\;re \cdot \left(1 + 0.5 \cdot {im}^{2}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 61.5% accurate, 2.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;im \leq 580:\\ \;\;\;\;\sin re\\ \mathbf{elif}\;im \leq 2.6 \cdot 10^{+124}:\\ \;\;\;\;0.08333333333333333 + \frac{0.25}{{re}^{2}}\\ \mathbf{else}:\\ \;\;\;\;re \cdot \left(1 + 0.5 \cdot {im}^{2}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= im 580.0)
   (sin re)
   (if (<= im 2.6e+124)
     (+ 0.08333333333333333 (/ 0.25 (pow re 2.0)))
     (* re (+ 1.0 (* 0.5 (pow im 2.0)))))))

C

double code(double re, double im) {
	double tmp;
	if (im <= 580.0) {
		tmp = sin(re);
	} else if (im <= 2.6e+124) {
		tmp = 0.08333333333333333 + (0.25 / pow(re, 2.0));
	} else {
		tmp = re * (1.0 + (0.5 * pow(im, 2.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 <= 580.0d0) then
        tmp = sin(re)
    else if (im <= 2.6d+124) then
        tmp = 0.08333333333333333d0 + (0.25d0 / (re ** 2.0d0))
    else
        tmp = re * (1.0d0 + (0.5d0 * (im ** 2.0d0)))
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (im <= 580.0) {
		tmp = Math.sin(re);
	} else if (im <= 2.6e+124) {
		tmp = 0.08333333333333333 + (0.25 / Math.pow(re, 2.0));
	} else {
		tmp = re * (1.0 + (0.5 * Math.pow(im, 2.0)));
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if im <= 580.0:
		tmp = math.sin(re)
	elif im <= 2.6e+124:
		tmp = 0.08333333333333333 + (0.25 / math.pow(re, 2.0))
	else:
		tmp = re * (1.0 + (0.5 * math.pow(im, 2.0)))
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (im <= 580.0)
		tmp = sin(re);
	elseif (im <= 2.6e+124)
		tmp = Float64(0.08333333333333333 + Float64(0.25 / (re ^ 2.0)));
	else
		tmp = Float64(re * Float64(1.0 + Float64(0.5 * (im ^ 2.0))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (im <= 580.0)
		tmp = sin(re);
	elseif (im <= 2.6e+124)
		tmp = 0.08333333333333333 + (0.25 / (re ^ 2.0));
	else
		tmp = re * (1.0 + (0.5 * (im ^ 2.0)));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[im, 580.0], N[Sin[re], $MachinePrecision], If[LessEqual[im, 2.6e+124], N[(0.08333333333333333 + N[(0.25 / N[Power[re, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(re * N[(1.0 + N[(0.5 * N[Power[im, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if im < 580

   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. neg-sub0 100.0%

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

      6. remove-double-neg 100.0%

         \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 66.6%

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

   if 580 < im < 2.6e124

   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. neg-sub0 100.0%

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

      6. remove-double-neg 100.0%

         \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 19.9%

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

   7. Taylor expanded in re around 0 19.9%

      \[\leadsto \color{blue}{0.08333333333333333 + 0.25 \cdot \frac{1}{{re}^{2}}} \]
   8. Step-by-step derivation

      1. associate-*r/ 19.9%

         \[\leadsto 0.08333333333333333 + \color{blue}{\frac{0.25 \cdot 1}{{re}^{2}}} \]

      2. metadata-eval 19.9%

         \[\leadsto 0.08333333333333333 + \frac{\color{blue}{0.25}}{{re}^{2}} \]

   9. Simplified 19.9%

      \[\leadsto \color{blue}{0.08333333333333333 + \frac{0.25}{{re}^{2}}} \]

   if 2.6e124 < 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. neg-sub0 100.0%

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

      6. remove-double-neg 100.0%

         \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 79.2%

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

   7. Simplified 79.2%

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

   8. Taylor expanded in re around 0 59.7%

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

4. Final simplification 61.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 580:\\ \;\;\;\;\sin re\\ \mathbf{elif}\;im \leq 2.6 \cdot 10^{+124}:\\ \;\;\;\;0.08333333333333333 + \frac{0.25}{{re}^{2}}\\ \mathbf{else}:\\ \;\;\;\;re \cdot \left(1 + 0.5 \cdot {im}^{2}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 61.5% accurate, 2.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;im \leq 750:\\ \;\;\;\;\sin re\\ \mathbf{elif}\;im \leq 7.5 \cdot 10^{+125}:\\ \;\;\;\;\frac{0.25}{{re}^{2}}\\ \mathbf{else}:\\ \;\;\;\;re \cdot \left(0.5 \cdot {im}^{2}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= im 750.0)
   (sin re)
   (if (<= im 7.5e+125) (/ 0.25 (pow re 2.0)) (* re (* 0.5 (pow im 2.0))))))

C

double code(double re, double im) {
	double tmp;
	if (im <= 750.0) {
		tmp = sin(re);
	} else if (im <= 7.5e+125) {
		tmp = 0.25 / pow(re, 2.0);
	} else {
		tmp = re * (0.5 * pow(im, 2.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 <= 750.0d0) then
        tmp = sin(re)
    else if (im <= 7.5d+125) then
        tmp = 0.25d0 / (re ** 2.0d0)
    else
        tmp = re * (0.5d0 * (im ** 2.0d0))
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (im <= 750.0) {
		tmp = Math.sin(re);
	} else if (im <= 7.5e+125) {
		tmp = 0.25 / Math.pow(re, 2.0);
	} else {
		tmp = re * (0.5 * Math.pow(im, 2.0));
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if im <= 750.0:
		tmp = math.sin(re)
	elif im <= 7.5e+125:
		tmp = 0.25 / math.pow(re, 2.0)
	else:
		tmp = re * (0.5 * math.pow(im, 2.0))
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (im <= 750.0)
		tmp = sin(re);
	elseif (im <= 7.5e+125)
		tmp = Float64(0.25 / (re ^ 2.0));
	else
		tmp = Float64(re * Float64(0.5 * (im ^ 2.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (im <= 750.0)
		tmp = sin(re);
	elseif (im <= 7.5e+125)
		tmp = 0.25 / (re ^ 2.0);
	else
		tmp = re * (0.5 * (im ^ 2.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[im, 750.0], N[Sin[re], $MachinePrecision], If[LessEqual[im, 7.5e+125], N[(0.25 / N[Power[re, 2.0], $MachinePrecision]), $MachinePrecision], N[(re * N[(0.5 * N[Power[im, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if im < 750

   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. neg-sub0 100.0%

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

      6. remove-double-neg 100.0%

         \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 66.6%

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

   if 750 < im < 7.5000000000000006e125

   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. neg-sub0 100.0%

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

      6. remove-double-neg 100.0%

         \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 19.9%

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

   7. Taylor expanded in re around 0 19.7%

      \[\leadsto \color{blue}{\frac{0.25}{{re}^{2}}} \]

   if 7.5000000000000006e125 < 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. neg-sub0 100.0%

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

      6. remove-double-neg 100.0%

         \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 79.2%

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

   7. Simplified 79.2%

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

   8. Taylor expanded in re around 0 59.7%

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

   9. Taylor expanded in im around inf 59.7%

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

       1. associate-*r* 59.7%

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

       2. *-commutative 59.7%

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

   11. Simplified 59.7%

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

4. Final simplification 61.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 750:\\ \;\;\;\;\sin re\\ \mathbf{elif}\;im \leq 7.5 \cdot 10^{+125}:\\ \;\;\;\;\frac{0.25}{{re}^{2}}\\ \mathbf{else}:\\ \;\;\;\;re \cdot \left(0.5 \cdot {im}^{2}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 61.5% accurate, 2.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;im \leq 600:\\ \;\;\;\;\sin re\\ \mathbf{elif}\;im \leq 8.5 \cdot 10^{+126}:\\ \;\;\;\;0.08333333333333333 + \frac{0.25}{{re}^{2}}\\ \mathbf{else}:\\ \;\;\;\;re \cdot \left(0.5 \cdot {im}^{2}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= im 600.0)
   (sin re)
   (if (<= im 8.5e+126)
     (+ 0.08333333333333333 (/ 0.25 (pow re 2.0)))
     (* re (* 0.5 (pow im 2.0))))))

C

double code(double re, double im) {
	double tmp;
	if (im <= 600.0) {
		tmp = sin(re);
	} else if (im <= 8.5e+126) {
		tmp = 0.08333333333333333 + (0.25 / pow(re, 2.0));
	} else {
		tmp = re * (0.5 * pow(im, 2.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 <= 600.0d0) then
        tmp = sin(re)
    else if (im <= 8.5d+126) then
        tmp = 0.08333333333333333d0 + (0.25d0 / (re ** 2.0d0))
    else
        tmp = re * (0.5d0 * (im ** 2.0d0))
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (im <= 600.0) {
		tmp = Math.sin(re);
	} else if (im <= 8.5e+126) {
		tmp = 0.08333333333333333 + (0.25 / Math.pow(re, 2.0));
	} else {
		tmp = re * (0.5 * Math.pow(im, 2.0));
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if im <= 600.0:
		tmp = math.sin(re)
	elif im <= 8.5e+126:
		tmp = 0.08333333333333333 + (0.25 / math.pow(re, 2.0))
	else:
		tmp = re * (0.5 * math.pow(im, 2.0))
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (im <= 600.0)
		tmp = sin(re);
	elseif (im <= 8.5e+126)
		tmp = Float64(0.08333333333333333 + Float64(0.25 / (re ^ 2.0)));
	else
		tmp = Float64(re * Float64(0.5 * (im ^ 2.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (im <= 600.0)
		tmp = sin(re);
	elseif (im <= 8.5e+126)
		tmp = 0.08333333333333333 + (0.25 / (re ^ 2.0));
	else
		tmp = re * (0.5 * (im ^ 2.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[im, 600.0], N[Sin[re], $MachinePrecision], If[LessEqual[im, 8.5e+126], N[(0.08333333333333333 + N[(0.25 / N[Power[re, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(re * N[(0.5 * N[Power[im, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if im < 600

   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. neg-sub0 100.0%

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

      6. remove-double-neg 100.0%

         \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 66.6%

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

   if 600 < im < 8.49999999999999944e126

   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. neg-sub0 100.0%

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

      6. remove-double-neg 100.0%

         \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 19.9%

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

   7. Taylor expanded in re around 0 19.9%

      \[\leadsto \color{blue}{0.08333333333333333 + 0.25 \cdot \frac{1}{{re}^{2}}} \]
   8. Step-by-step derivation

      1. associate-*r/ 19.9%

         \[\leadsto 0.08333333333333333 + \color{blue}{\frac{0.25 \cdot 1}{{re}^{2}}} \]

      2. metadata-eval 19.9%

         \[\leadsto 0.08333333333333333 + \frac{\color{blue}{0.25}}{{re}^{2}} \]

   9. Simplified 19.9%

      \[\leadsto \color{blue}{0.08333333333333333 + \frac{0.25}{{re}^{2}}} \]

   if 8.49999999999999944e126 < 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. neg-sub0 100.0%

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

      6. remove-double-neg 100.0%

         \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 79.2%

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

   7. Simplified 79.2%

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

   8. Taylor expanded in re around 0 59.7%

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

   9. Taylor expanded in im around inf 59.7%

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

       1. associate-*r* 59.7%

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

       2. *-commutative 59.7%

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

   11. Simplified 59.7%

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

4. Final simplification 61.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 600:\\ \;\;\;\;\sin re\\ \mathbf{elif}\;im \leq 8.5 \cdot 10^{+126}:\\ \;\;\;\;0.08333333333333333 + \frac{0.25}{{re}^{2}}\\ \mathbf{else}:\\ \;\;\;\;re \cdot \left(0.5 \cdot {im}^{2}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 53.7% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;im \leq 580:\\ \;\;\;\;\sin re\\ \mathbf{else}:\\ \;\;\;\;\frac{0.25}{{re}^{2}}\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= im 580.0) (sin re) (/ 0.25 (pow re 2.0))))

C

double code(double re, double im) {
	double tmp;
	if (im <= 580.0) {
		tmp = sin(re);
	} else {
		tmp = 0.25 / pow(re, 2.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 <= 580.0d0) then
        tmp = sin(re)
    else
        tmp = 0.25d0 / (re ** 2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (im <= 580.0) {
		tmp = Math.sin(re);
	} else {
		tmp = 0.25 / Math.pow(re, 2.0);
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if im <= 580.0:
		tmp = math.sin(re)
	else:
		tmp = 0.25 / math.pow(re, 2.0)
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (im <= 580.0)
		tmp = sin(re);
	else
		tmp = Float64(0.25 / (re ^ 2.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (im <= 580.0)
		tmp = sin(re);
	else
		tmp = 0.25 / (re ^ 2.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[im, 580.0], N[Sin[re], $MachinePrecision], N[(0.25 / N[Power[re, 2.0], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if im < 580

   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. neg-sub0 100.0%

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

      6. remove-double-neg 100.0%

         \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 66.6%

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

   if 580 < 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. neg-sub0 100.0%

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

      6. remove-double-neg 100.0%

         \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 13.9%

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

   7. Taylor expanded in re around 0 13.8%

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

4. Final simplification 53.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 580:\\ \;\;\;\;\sin re\\ \mathbf{else}:\\ \;\;\;\;\frac{0.25}{{re}^{2}}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 50.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. neg-sub0 100.0%

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

   6. remove-double-neg 100.0%

      \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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.1%

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

6. Final simplification 50.1%

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

Alternative 10: 4.3% accurate, 309.0× speedup

Math

\[\begin{array}{l} \\ -2 \end{array} \]

FPCore

(FPCore (re im) :precision binary64 -2.0)

C

double code(double re, double im) {
	return -2.0;
}

Fortran

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

Java

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

Python

def code(re, im):
	return -2.0

Julia

function code(re, im)
	return -2.0
end

MATLAB

function tmp = code(re, im)
	tmp = -2.0;
end

Wolfram

code[re_, im_] := -2.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. neg-sub0 100.0%

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

   6. remove-double-neg 100.0%

      \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 68.4%

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

7. Simplified 68.4%

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

9. Applied egg-rr 4.1%

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

10. Final simplification 4.1%

    \[\leadsto -2 \]
11. Add Preprocessing

Alternative 11: 4.7% 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. neg-sub0 100.0%

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

   6. remove-double-neg 100.0%

      \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 68.4%

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

7. Simplified 68.4%

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

9. Applied egg-rr 4.6%

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

10. Final simplification 4.6%

    \[\leadsto -1 \]
11. Add Preprocessing

Alternative 12: 4.2% accurate, 309.0× speedup

Math

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

FPCore

(FPCore (re im) :precision binary64 0.0625)

C

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

Fortran

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

Java

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

Python

def code(re, im):
	return 0.0625

Julia

function code(re, im)
	return 0.0625
end

MATLAB

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

Wolfram

code[re_, im_] := 0.0625

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. neg-sub0 100.0%

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

   6. remove-double-neg 100.0%

      \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 68.4%

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

7. Simplified 68.4%

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

9. Applied egg-rr 3.8%

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

10. Final simplification 3.8%

    \[\leadsto 0.0625 \]
11. Add Preprocessing

Alternative 13: 4.3% accurate, 309.0× speedup

Math

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

FPCore

(FPCore (re im) :precision binary64 0.125)

C

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

Fortran

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

Java

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

Python

def code(re, im):
	return 0.125

Julia

function code(re, im)
	return 0.125
end

MATLAB

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

Wolfram

code[re_, im_] := 0.125

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. neg-sub0 100.0%

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

   6. remove-double-neg 100.0%

      \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 68.4%

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

7. Simplified 68.4%

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

9. Applied egg-rr 3.9%

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

10. Final simplification 3.9%

    \[\leadsto 0.125 \]
11. Add Preprocessing

Alternative 14: 4.5% accurate, 309.0× speedup

Math

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

FPCore

(FPCore (re im) :precision binary64 0.25)

C

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

Fortran

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

Java

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

Python

def code(re, im):
	return 0.25

Julia

function code(re, im)
	return 0.25
end

MATLAB

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

Wolfram

code[re_, im_] := 0.25

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. neg-sub0 100.0%

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

   6. remove-double-neg 100.0%

      \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 68.4%

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

7. Simplified 68.4%

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

9. Applied egg-rr 4.0%

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

10. Final simplification 4.0%

    \[\leadsto 0.25 \]
11. Add Preprocessing

Alternative 15: 4.7% accurate, 309.0× speedup

Math

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

FPCore

(FPCore (re im) :precision binary64 0.5)

C

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

Fortran

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

Java

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

Python

def code(re, im):
	return 0.5

Julia

function code(re, im)
	return 0.5
end

MATLAB

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

Wolfram

code[re_, im_] := 0.5

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. neg-sub0 100.0%

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

   6. remove-double-neg 100.0%

      \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 68.4%

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

7. Simplified 68.4%

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

9. Applied egg-rr 4.1%

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

10. Final simplification 4.1%

    \[\leadsto 0.5 \]
11. Add Preprocessing

Alternative 16: 4.8% accurate, 309.0× speedup

Math

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

FPCore

(FPCore (re im) :precision binary64 0.75)

C

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

Fortran

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

Java

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

Python

def code(re, im):
	return 0.75

Julia

function code(re, im)
	return 0.75
end

MATLAB

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

Wolfram

code[re_, im_] := 0.75

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. neg-sub0 100.0%

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

   6. remove-double-neg 100.0%

      \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 68.4%

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

7. Simplified 68.4%

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

9. Applied egg-rr 4.1%

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

10. Final simplification 4.1%

    \[\leadsto 0.75 \]
11. Add Preprocessing

Alternative 17: 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. neg-sub0 100.0%

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

   6. remove-double-neg 100.0%

      \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 68.4%

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

7. Simplified 68.4%

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

9. Applied egg-rr 4.2%

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

10. Final simplification 4.2%

    \[\leadsto 1 \]
11. Add Preprocessing

Alternative 18: 26.3% accurate, 309.0× speedup

Math

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

FPCore

(FPCore (re im) :precision binary64 re)

C

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

Fortran

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

Java

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

Python

def code(re, im):
	return re

Julia

function code(re, im)
	return re
end

MATLAB

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

Wolfram

code[re_, im_] := re

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. neg-sub0 100.0%

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

   6. remove-double-neg 100.0%

      \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + \color{blue}{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 68.4%

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

7. Simplified 68.4%

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

8. Taylor expanded in im around 0 31.0%

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

9. Final simplification 31.0%

   \[\leadsto re \]
10. Add Preprocessing

Reproduce

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