math.exp on complex, imaginary part

Percentage Accurate: 100.0% → 100.0%

Time: 5.7s

Alternatives: 7

Speedup: 1.0×

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

Specification

Math

\[\begin{array}{l} \\ e^{re} \cdot \sin im \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ e^{re} \cdot \sin im \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ e^{re} \cdot \sin im \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[e^{re} \cdot \sin im \]

2. Final simplification 100.0%

   \[\leadsto e^{re} \cdot \sin im \]

Alternative 2: 92.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{re} \leq 0.99999995 \lor \neg \left(e^{re} \leq 2\right):\\ \;\;\;\;e^{re} \cdot im\\ \mathbf{else}:\\ \;\;\;\;\sin im \cdot \left(re + 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (or (<= (exp re) 0.99999995) (not (<= (exp re) 2.0)))
   (* (exp re) im)
   (* (sin im) (+ re 1.0))))

C

double code(double re, double im) {
	double tmp;
	if ((exp(re) <= 0.99999995) || !(exp(re) <= 2.0)) {
		tmp = exp(re) * im;
	} else {
		tmp = sin(im) * (re + 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 ((exp(re) <= 0.99999995d0) .or. (.not. (exp(re) <= 2.0d0))) then
        tmp = exp(re) * im
    else
        tmp = sin(im) * (re + 1.0d0)
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if ((Math.exp(re) <= 0.99999995) || !(Math.exp(re) <= 2.0)) {
		tmp = Math.exp(re) * im;
	} else {
		tmp = Math.sin(im) * (re + 1.0);
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if (math.exp(re) <= 0.99999995) or not (math.exp(re) <= 2.0):
		tmp = math.exp(re) * im
	else:
		tmp = math.sin(im) * (re + 1.0)
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if ((exp(re) <= 0.99999995) || !(exp(re) <= 2.0))
		tmp = Float64(exp(re) * im);
	else
		tmp = Float64(sin(im) * Float64(re + 1.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if ((exp(re) <= 0.99999995) || ~((exp(re) <= 2.0)))
		tmp = exp(re) * im;
	else
		tmp = sin(im) * (re + 1.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[Or[LessEqual[N[Exp[re], $MachinePrecision], 0.99999995], N[Not[LessEqual[N[Exp[re], $MachinePrecision], 2.0]], $MachinePrecision]], N[(N[Exp[re], $MachinePrecision] * im), $MachinePrecision], N[(N[Sin[im], $MachinePrecision] * N[(re + 1.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (exp.f64 re) < 0.999999949999999971 or 2 < (exp.f64 re)

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]

   2. Taylor expanded in im around 0 88.0%

      \[\leadsto e^{re} \cdot \color{blue}{im} \]

   if 0.999999949999999971 < (exp.f64 re) < 2

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]

   2. Taylor expanded in re around 0 100.0%

      \[\leadsto \color{blue}{\sin im + re \cdot \sin im} \]
   3. Step-by-step derivation

      1. distribute-rgt1-in 100.0%

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

   4. Simplified 100.0%

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

4. Final simplification 93.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{re} \leq 0.99999995 \lor \neg \left(e^{re} \leq 2\right):\\ \;\;\;\;e^{re} \cdot im\\ \mathbf{else}:\\ \;\;\;\;\sin im \cdot \left(re + 1\right)\\ \end{array} \]

Alternative 3: 92.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{re} \leq 0.99999995 \lor \neg \left(e^{re} \leq 2\right):\\ \;\;\;\;e^{re} \cdot im\\ \mathbf{else}:\\ \;\;\;\;\sin im\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (or (<= (exp re) 0.99999995) (not (<= (exp re) 2.0)))
   (* (exp re) im)
   (sin im)))

C

double code(double re, double im) {
	double tmp;
	if ((exp(re) <= 0.99999995) || !(exp(re) <= 2.0)) {
		tmp = exp(re) * im;
	} else {
		tmp = sin(im);
	}
	return tmp;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if ((exp(re) <= 0.99999995d0) .or. (.not. (exp(re) <= 2.0d0))) then
        tmp = exp(re) * im
    else
        tmp = sin(im)
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if ((Math.exp(re) <= 0.99999995) || !(Math.exp(re) <= 2.0)) {
		tmp = Math.exp(re) * im;
	} else {
		tmp = Math.sin(im);
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if (math.exp(re) <= 0.99999995) or not (math.exp(re) <= 2.0):
		tmp = math.exp(re) * im
	else:
		tmp = math.sin(im)
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if ((exp(re) <= 0.99999995) || !(exp(re) <= 2.0))
		tmp = Float64(exp(re) * im);
	else
		tmp = sin(im);
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if ((exp(re) <= 0.99999995) || ~((exp(re) <= 2.0)))
		tmp = exp(re) * im;
	else
		tmp = sin(im);
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[Or[LessEqual[N[Exp[re], $MachinePrecision], 0.99999995], N[Not[LessEqual[N[Exp[re], $MachinePrecision], 2.0]], $MachinePrecision]], N[(N[Exp[re], $MachinePrecision] * im), $MachinePrecision], N[Sin[im], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (exp.f64 re) < 0.999999949999999971 or 2 < (exp.f64 re)

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]

   2. Taylor expanded in im around 0 88.0%

      \[\leadsto e^{re} \cdot \color{blue}{im} \]

   if 0.999999949999999971 < (exp.f64 re) < 2

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]

   2. Taylor expanded in re around 0 99.2%

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

4. Final simplification 93.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{re} \leq 0.99999995 \lor \neg \left(e^{re} \leq 2\right):\\ \;\;\;\;e^{re} \cdot im\\ \mathbf{else}:\\ \;\;\;\;\sin im\\ \end{array} \]

Alternative 4: 53.5% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq 3.8 \cdot 10^{+31}:\\ \;\;\;\;\sin im\\ \mathbf{else}:\\ \;\;\;\;re \cdot im\\ \end{array} \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (if (<= re 3.8e+31) (sin im) (* re im)))

C

double code(double re, double im) {
	double tmp;
	if (re <= 3.8e+31) {
		tmp = sin(im);
	} else {
		tmp = re * im;
	}
	return tmp;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if (re <= 3.8d+31) then
        tmp = sin(im)
    else
        tmp = re * im
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (re <= 3.8e+31) {
		tmp = Math.sin(im);
	} else {
		tmp = re * im;
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if re <= 3.8e+31:
		tmp = math.sin(im)
	else:
		tmp = re * im
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (re <= 3.8e+31)
		tmp = sin(im);
	else
		tmp = Float64(re * im);
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (re <= 3.8e+31)
		tmp = sin(im);
	else
		tmp = re * im;
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[re, 3.8e+31], N[Sin[im], $MachinePrecision], N[(re * im), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if re < 3.8000000000000001e31

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]

   2. Taylor expanded in re around 0 64.6%

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

   if 3.8000000000000001e31 < re

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]

   2. Taylor expanded in re around 0 4.5%

      \[\leadsto \color{blue}{\sin im + re \cdot \sin im} \]
   3. Step-by-step derivation

      1. distribute-rgt1-in 4.5%

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

   4. Simplified 4.5%

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

   5. Taylor expanded in re around inf 4.5%

      \[\leadsto \color{blue}{re \cdot \sin im} \]
   6. Step-by-step derivation

      1. *-commutative 4.5%

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

   7. Simplified 4.5%

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

   8. Taylor expanded in im around 0 17.5%

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

4. Final simplification 53.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;re \leq 3.8 \cdot 10^{+31}:\\ \;\;\;\;\sin im\\ \mathbf{else}:\\ \;\;\;\;re \cdot im\\ \end{array} \]

Alternative 5: 27.7% accurate, 40.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;im \leq 1.08 \cdot 10^{+43}:\\ \;\;\;\;im\\ \mathbf{else}:\\ \;\;\;\;re \cdot im\\ \end{array} \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (if (<= im 1.08e+43) im (* re im)))

C

double code(double re, double im) {
	double tmp;
	if (im <= 1.08e+43) {
		tmp = im;
	} else {
		tmp = re * im;
	}
	return tmp;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if (im <= 1.08d+43) then
        tmp = im
    else
        tmp = re * im
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (im <= 1.08e+43) {
		tmp = im;
	} else {
		tmp = re * im;
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if im <= 1.08e+43:
		tmp = im
	else:
		tmp = re * im
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (im <= 1.08e+43)
		tmp = im;
	else
		tmp = Float64(re * im);
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (im <= 1.08e+43)
		tmp = im;
	else
		tmp = re * im;
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[im, 1.08e+43], im, N[(re * im), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if im < 1.08e43

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]

   2. Taylor expanded in im around 0 78.2%

      \[\leadsto e^{re} \cdot \color{blue}{im} \]

   3. Taylor expanded in re around 0 33.5%

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

   if 1.08e43 < im

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]

   2. Taylor expanded in re around 0 51.6%

      \[\leadsto \color{blue}{\sin im + re \cdot \sin im} \]
   3. Step-by-step derivation

      1. distribute-rgt1-in 51.6%

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

   4. Simplified 51.6%

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

   5. Taylor expanded in re around inf 3.8%

      \[\leadsto \color{blue}{re \cdot \sin im} \]
   6. Step-by-step derivation

      1. *-commutative 3.8%

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

   7. Simplified 3.8%

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

   8. Taylor expanded in im around 0 6.7%

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

4. Final simplification 27.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 1.08 \cdot 10^{+43}:\\ \;\;\;\;im\\ \mathbf{else}:\\ \;\;\;\;re \cdot im\\ \end{array} \]

Alternative 6: 29.2% accurate, 40.6× speedup

Math

\[\begin{array}{l} \\ im \cdot \left(re + 1\right) \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (* im (+ re 1.0)))

C

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

Fortran

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

Java

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

Python

def code(re, im):
	return im * (re + 1.0)

Julia

function code(re, im)
	return Float64(im * Float64(re + 1.0))
end

MATLAB

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

Wolfram

code[re_, im_] := N[(im * N[(re + 1.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[e^{re} \cdot \sin im \]

2. Taylor expanded in re around 0 50.6%

   \[\leadsto \color{blue}{\sin im + re \cdot \sin im} \]
3. Step-by-step derivation

   1. distribute-rgt1-in 50.6%

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

4. Simplified 50.6%

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

5. Taylor expanded in im around 0 30.2%

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

6. Final simplification 30.2%

   \[\leadsto im \cdot \left(re + 1\right) \]

Alternative 7: 26.2% accurate, 203.0× speedup

Math

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

FPCore

(FPCore (re im) :precision binary64 im)

C

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

Fortran

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

Java

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

Python

def code(re, im):
	return im

Julia

function code(re, im)
	return im
end

MATLAB

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

Wolfram

code[re_, im_] := im

Derivation

1. Initial program 100.0%

   \[e^{re} \cdot \sin im \]

2. Taylor expanded in im around 0 70.3%

   \[\leadsto e^{re} \cdot \color{blue}{im} \]

3. Taylor expanded in re around 0 26.8%

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

4. Final simplification 26.8%

   \[\leadsto im \]

Reproduce

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