math.exp on complex, imaginary part

Percentage Accurate: 100.0% → 100.0%

Time: 5.6s

Alternatives: 7

Speedup: 1.0×

• 25.3% 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

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 2: 92.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{re} \leq 0.9999995 \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.9999995) (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.9999995) || !(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.9999995d0) .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.9999995) || !(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.9999995) 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.9999995) || !(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.9999995) || ~((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.9999995], 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

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 3: 69.0% 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

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 4: 52.0% accurate, 1.9× speedup

Math

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

FPCore

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

C

double code(double re, double im) {
	double tmp;
	if (re <= 2.1e-25) {
		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 <= 2.1d-25) 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 <= 2.1e-25) {
		tmp = Math.sin(im);
	} else {
		tmp = im * (re + 1.0);
	}
	return tmp;
}

Python

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

Julia

function code(re, im)
	tmp = 0.0
	if (re <= 2.1e-25)
		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 <= 2.1e-25)
		tmp = sin(im);
	else
		tmp = im * (re + 1.0);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 5: 27.6% accurate, 25.3× speedup

Math

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

FPCore

(FPCore (re im) :precision binary64 (if (<= im 1.2e+113) im (* re im)))

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 6: 29.1% 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

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

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

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Reproduce

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