math.exp on complex, imaginary part

Percentage Accurate: 100.0% → 100.0%

Time: 6.0s

Alternatives: 7

Speedup: 1.0×

• 24.5% 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. Add Preprocessing

3. Final simplification 100.0%

   \[\leadsto e^{re} \cdot \sin im \]
4. Add Preprocessing

Alternative 2: 92.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{re} \leq 0.9999999 \lor \neg \left(e^{re} \leq 1\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.9999999) (not (<= (exp re) 1.0)))
   (* (exp re) im)
   (* (sin im) (+ re 1.0))))

C

double code(double re, double im) {
	double tmp;
	if ((exp(re) <= 0.9999999) || !(exp(re) <= 1.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.9999999d0) .or. (.not. (exp(re) <= 1.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.9999999) || !(Math.exp(re) <= 1.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.9999999) or not (math.exp(re) <= 1.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.9999999) || !(exp(re) <= 1.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.9999999) || ~((exp(re) <= 1.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.9999999], N[Not[LessEqual[N[Exp[re], $MachinePrecision], 1.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.999999900000000053 or 1 < (exp.f64 re)

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0 87.0%

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

   if 0.999999900000000053 < (exp.f64 re) < 1

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0 100.0%

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

      1. distribute-rgt1-in 100.0%

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

   5. Simplified 100.0%

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

4. Final simplification 93.4%

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

Alternative 3: 69.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := e^{re} \leq 1\\ \mathbf{if}\;t_0 \lor \neg t_0:\\ \;\;\;\;e^{re} \cdot im\\ \mathbf{else}:\\ \;\;\;\;\sin im\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (<= (exp re) 1.0)))
   (if (or t_0 (not t_0)) (* (exp re) im) (sin im))))

C

double code(double re, double im) {
	int t_0 = exp(re) <= 1.0;
	double tmp;
	if (t_0 || !t_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
    logical :: t_0
    real(8) :: tmp
    t_0 = exp(re) <= 1.0d0
    if (t_0 .or. (.not. t_0)) then
        tmp = exp(re) * im
    else
        tmp = sin(im)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[re_, im_] := Block[{t$95$0 = LessEqual[N[Exp[re], $MachinePrecision], 1.0]}, If[Or[t$95$0, N[Not[t$95$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) < 1 or 1 < (exp.f64 re)

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0 70.4%

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

   if 1 < (exp.f64 re) < 1

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0 50.9%

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

4. Final simplification 70.4%

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

Alternative 4: 52.9% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq 5.8 \cdot 10^{-8}:\\ \;\;\;\;\sin im\\ \mathbf{else}:\\ \;\;\;\;im \cdot \left(re + 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re 5.8e-8) (sin im) (* im (+ re 1.0))))

C

double code(double re, double im) {
	double tmp;
	if (re <= 5.8e-8) {
		tmp = sin(im);
	} else {
		tmp = 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 (re <= 5.8d-8) then
        tmp = sin(im)
    else
        tmp = im * (re + 1.0d0)
    end if
    code = tmp
end function

Java

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

Python

def code(re, im):
	tmp = 0
	if re <= 5.8e-8:
		tmp = math.sin(im)
	else:
		tmp = im * (re + 1.0)
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (re <= 5.8e-8)
		tmp = sin(im);
	else
		tmp = Float64(im * Float64(re + 1.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (re <= 5.8e-8)
		tmp = sin(im);
	else
		tmp = im * (re + 1.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[re, 5.8e-8], N[Sin[im], $MachinePrecision], N[(im * N[(re + 1.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if re < 5.8000000000000003e-8

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0 70.3%

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

   if 5.8000000000000003e-8 < re

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0 5.3%

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

      1. distribute-rgt1-in 5.3%

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

   5. Simplified 5.3%

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

   6. Taylor expanded in im around 0 15.6%

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

4. Final simplification 54.5%

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

Alternative 5: 27.4% accurate, 25.3× speedup

Math

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

FPCore

(FPCore (re im) :precision binary64 (if (<= im 1.9e+133) im (* re im)))

C

double code(double re, double im) {
	double tmp;
	if (im <= 1.9e+133) {
		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.9d+133) 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.9e+133) {
		tmp = im;
	} else {
		tmp = re * im;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if im < 1.9000000000000001e133

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0 76.8%

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

   4. Taylor expanded in re around 0 33.2%

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

   if 1.9000000000000001e133 < im

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]
   2. Add Preprocessing

   3. Taylor expanded in im around 0 39.4%

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

   4. Taylor expanded in re around 0 15.1%

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

   5. Taylor expanded in re around inf 16.1%

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

4. Final simplification 30.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \leq 1.9 \cdot 10^{+133}:\\ \;\;\;\;im\\ \mathbf{else}:\\ \;\;\;\;re \cdot im\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 29.0% 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. Add Preprocessing

3. Taylor expanded in re around 0 51.3%

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

   1. distribute-rgt1-in 51.3%

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

5. Simplified 51.3%

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

6. Taylor expanded in im around 0 31.3%

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

7. Final simplification 31.3%

   \[\leadsto im \cdot \left(re + 1\right) \]
8. Add Preprocessing

Alternative 7: 26.0% 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. Add Preprocessing

3. Taylor expanded in im around 0 70.4%

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

4. Taylor expanded in re around 0 27.9%

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

5. Final simplification 27.9%

   \[\leadsto im \]
6. Add Preprocessing

Reproduce

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