math.exp on complex, real part

Percentage Accurate: 100.0% → 100.0%

Time: 6.5s

Alternatives: 8

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 \cos im \end{array} \]

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

Alternative 2: 99.0% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \cos im \cdot \left(re - -1\right)\\ t_1 := e^{re} \cdot \cos im\\ t_2 := e^{re} \cdot \left(0.5 - -0.5\right)\\ \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;e^{re} \cdot \mathsf{fma}\left(im \cdot im, -0.5, 1\right)\\ \mathbf{elif}\;t\_1 \leq -0.02:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq 0:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 0.9990711065241679:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (cos im) (- re -1.0)))
        (t_1 (* (exp re) (cos im)))
        (t_2 (* (exp re) (- 0.5 -0.5))))
   (if (<= t_1 (- INFINITY))
     (* (exp re) (fma (* im im) -0.5 1.0))
     (if (<= t_1 -0.02)
       t_0
       (if (<= t_1 0.0) t_2 (if (<= t_1 0.9990711065241679) t_0 t_2))))))

C

double code(double re, double im) {
	double t_0 = cos(im) * (re - -1.0);
	double t_1 = exp(re) * cos(im);
	double t_2 = exp(re) * (0.5 - -0.5);
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = exp(re) * fma((im * im), -0.5, 1.0);
	} else if (t_1 <= -0.02) {
		tmp = t_0;
	} else if (t_1 <= 0.0) {
		tmp = t_2;
	} else if (t_1 <= 0.9990711065241679) {
		tmp = t_0;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(cos(im) * Float64(re - -1.0))
	t_1 = Float64(exp(re) * cos(im))
	t_2 = Float64(exp(re) * Float64(0.5 - -0.5))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(exp(re) * fma(Float64(im * im), -0.5, 1.0));
	elseif (t_1 <= -0.02)
		tmp = t_0;
	elseif (t_1 <= 0.0)
		tmp = t_2;
	elseif (t_1 <= 0.9990711065241679)
		tmp = t_0;
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Cos[im], $MachinePrecision] * N[(re - -1.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Exp[re], $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Exp[re], $MachinePrecision] * N[(0.5 - -0.5), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[Exp[re], $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -0.02], t$95$0, If[LessEqual[t$95$1, 0.0], t$95$2, If[LessEqual[t$95$1, 0.9990711065241679], t$95$0, t$95$2]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < -inf.0

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

   4. Applied rewrites 62.8%

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

   6. Applied rewrites 62.8%

      \[\leadsto e^{re} \cdot \mathsf{fma}\left(im \cdot im, \color{blue}{-0.5}, 1\right) \]

   if -inf.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < -0.0200000000000000004 or 0.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.999071106524167862

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

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

   4. Applied rewrites 51.5%

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

   6. Applied rewrites 51.5%

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

   if -0.0200000000000000004 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.0 or 0.999071106524167862 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

   4. Applied rewrites 62.8%

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

   6. Applied rewrites 62.8%

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

   7. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \left(\frac{1}{2} - \frac{-1}{2}\right) \]

   9. Applied rewrites 72.3%

      \[\leadsto e^{re} \cdot \left(0.5 - -0.5\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 98.7% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := e^{re} \cdot \cos im\\ t_1 := e^{re} \cdot \left(0.5 - -0.5\right)\\ \mathbf{if}\;t\_0 \leq -\infty:\\ \;\;\;\;e^{re} \cdot \mathsf{fma}\left(im \cdot im, -0.5, 1\right)\\ \mathbf{elif}\;t\_0 \leq -0.02:\\ \;\;\;\;\cos im\\ \mathbf{elif}\;t\_0 \leq 0:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 \leq 0.9990711065241679:\\ \;\;\;\;\cos im\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (exp re) (cos im))) (t_1 (* (exp re) (- 0.5 -0.5))))
   (if (<= t_0 (- INFINITY))
     (* (exp re) (fma (* im im) -0.5 1.0))
     (if (<= t_0 -0.02)
       (cos im)
       (if (<= t_0 0.0) t_1 (if (<= t_0 0.9990711065241679) (cos im) t_1))))))

C

double code(double re, double im) {
	double t_0 = exp(re) * cos(im);
	double t_1 = exp(re) * (0.5 - -0.5);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = exp(re) * fma((im * im), -0.5, 1.0);
	} else if (t_0 <= -0.02) {
		tmp = cos(im);
	} else if (t_0 <= 0.0) {
		tmp = t_1;
	} else if (t_0 <= 0.9990711065241679) {
		tmp = cos(im);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(exp(re) * cos(im))
	t_1 = Float64(exp(re) * Float64(0.5 - -0.5))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(exp(re) * fma(Float64(im * im), -0.5, 1.0));
	elseif (t_0 <= -0.02)
		tmp = cos(im);
	elseif (t_0 <= 0.0)
		tmp = t_1;
	elseif (t_0 <= 0.9990711065241679)
		tmp = cos(im);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Exp[re], $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Exp[re], $MachinePrecision] * N[(0.5 - -0.5), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[Exp[re], $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, -0.02], N[Cos[im], $MachinePrecision], If[LessEqual[t$95$0, 0.0], t$95$1, If[LessEqual[t$95$0, 0.9990711065241679], N[Cos[im], $MachinePrecision], t$95$1]]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < -inf.0

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

   4. Applied rewrites 62.8%

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

   6. Applied rewrites 62.8%

      \[\leadsto e^{re} \cdot \mathsf{fma}\left(im \cdot im, \color{blue}{-0.5}, 1\right) \]

   if -inf.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < -0.0200000000000000004 or 0.0 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.999071106524167862

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

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

   4. Applied rewrites 50.6%

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

   if -0.0200000000000000004 < (*.f64 (exp.f64 re) (cos.f64 im)) < 0.0 or 0.999071106524167862 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

   4. Applied rewrites 62.8%

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

   6. Applied rewrites 62.8%

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

   7. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \left(\frac{1}{2} - \frac{-1}{2}\right) \]

   9. Applied rewrites 72.3%

      \[\leadsto e^{re} \cdot \left(0.5 - -0.5\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 78.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{re} \cdot \cos im \leq -0.02:\\ \;\;\;\;e^{re} \cdot \mathsf{fma}\left(im \cdot im, -0.5, 1\right)\\ \mathbf{else}:\\ \;\;\;\;e^{re} \cdot \left(0.5 - -0.5\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (exp re) (cos im)) -0.02)
   (* (exp re) (fma (* im im) -0.5 1.0))
   (* (exp re) (- 0.5 -0.5))))

C

double code(double re, double im) {
	double tmp;
	if ((exp(re) * cos(im)) <= -0.02) {
		tmp = exp(re) * fma((im * im), -0.5, 1.0);
	} else {
		tmp = exp(re) * (0.5 - -0.5);
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(exp(re) * cos(im)) <= -0.02)
		tmp = Float64(exp(re) * fma(Float64(im * im), -0.5, 1.0));
	else
		tmp = Float64(exp(re) * Float64(0.5 - -0.5));
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[N[(N[Exp[re], $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision], -0.02], N[(N[Exp[re], $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[Exp[re], $MachinePrecision] * N[(0.5 - -0.5), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < -0.0200000000000000004

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

   4. Applied rewrites 62.8%

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

   6. Applied rewrites 62.8%

      \[\leadsto e^{re} \cdot \mathsf{fma}\left(im \cdot im, \color{blue}{-0.5}, 1\right) \]

   if -0.0200000000000000004 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

   4. Applied rewrites 62.8%

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

   6. Applied rewrites 62.8%

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

   7. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \left(\frac{1}{2} - \frac{-1}{2}\right) \]

   9. Applied rewrites 72.3%

      \[\leadsto e^{re} \cdot \left(0.5 - -0.5\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 77.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{re} \cdot \cos im \leq -0.02:\\ \;\;\;\;\left(re - -1\right) \cdot \mathsf{fma}\left(im \cdot im, -0.5, 1\right)\\ \mathbf{else}:\\ \;\;\;\;e^{re} \cdot \left(0.5 - -0.5\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (exp re) (cos im)) -0.02)
   (* (- re -1.0) (fma (* im im) -0.5 1.0))
   (* (exp re) (- 0.5 -0.5))))

C

double code(double re, double im) {
	double tmp;
	if ((exp(re) * cos(im)) <= -0.02) {
		tmp = (re - -1.0) * fma((im * im), -0.5, 1.0);
	} else {
		tmp = exp(re) * (0.5 - -0.5);
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(exp(re) * cos(im)) <= -0.02)
		tmp = Float64(Float64(re - -1.0) * fma(Float64(im * im), -0.5, 1.0));
	else
		tmp = Float64(exp(re) * Float64(0.5 - -0.5));
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[N[(N[Exp[re], $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision], -0.02], N[(N[(re - -1.0), $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[Exp[re], $MachinePrecision] * N[(0.5 - -0.5), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < -0.0200000000000000004

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

   4. Applied rewrites 62.8%

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

   6. Applied rewrites 62.8%

      \[\leadsto e^{re} \cdot \mathsf{fma}\left(im \cdot im, \color{blue}{-0.5}, 1\right) \]

   7. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\left(1 + re\right)} \cdot \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

   9. Applied rewrites 31.6%

      \[\leadsto \color{blue}{\left(1 + re\right)} \cdot \mathsf{fma}\left(im \cdot im, -0.5, 1\right) \]

   11. Applied rewrites 31.6%

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

   if -0.0200000000000000004 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

   4. Applied rewrites 62.8%

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

   6. Applied rewrites 62.8%

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

   7. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \left(\frac{1}{2} - \frac{-1}{2}\right) \]

   9. Applied rewrites 72.3%

      \[\leadsto e^{re} \cdot \left(0.5 - -0.5\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 34.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{re} \cdot \cos im \leq -0.02:\\ \;\;\;\;\left(re - -1\right) \cdot \mathsf{fma}\left(im \cdot im, -0.5, 1\right)\\ \mathbf{else}:\\ \;\;\;\;\left(1 + re\right) \cdot \left(0.5 - -0.5\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (exp re) (cos im)) -0.02)
   (* (- re -1.0) (fma (* im im) -0.5 1.0))
   (* (+ 1.0 re) (- 0.5 -0.5))))

C

double code(double re, double im) {
	double tmp;
	if ((exp(re) * cos(im)) <= -0.02) {
		tmp = (re - -1.0) * fma((im * im), -0.5, 1.0);
	} else {
		tmp = (1.0 + re) * (0.5 - -0.5);
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(exp(re) * cos(im)) <= -0.02)
		tmp = Float64(Float64(re - -1.0) * fma(Float64(im * im), -0.5, 1.0));
	else
		tmp = Float64(Float64(1.0 + re) * Float64(0.5 - -0.5));
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[N[(N[Exp[re], $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision], -0.02], N[(N[(re - -1.0), $MachinePrecision] * N[(N[(im * im), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + re), $MachinePrecision] * N[(0.5 - -0.5), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < -0.0200000000000000004

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

   4. Applied rewrites 62.8%

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

   6. Applied rewrites 62.8%

      \[\leadsto e^{re} \cdot \mathsf{fma}\left(im \cdot im, \color{blue}{-0.5}, 1\right) \]

   7. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\left(1 + re\right)} \cdot \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

   9. Applied rewrites 31.6%

      \[\leadsto \color{blue}{\left(1 + re\right)} \cdot \mathsf{fma}\left(im \cdot im, -0.5, 1\right) \]

   11. Applied rewrites 31.6%

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

   if -0.0200000000000000004 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

   4. Applied rewrites 62.8%

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

   6. Applied rewrites 62.8%

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

   7. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \left(\frac{1}{2} - \frac{-1}{2}\right) \]

   9. Applied rewrites 72.3%

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

   10. Taylor expanded in re around 0

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

   12. Applied rewrites 29.6%

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

Alternative 7: 33.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{re} \cdot \cos im \leq 0:\\ \;\;\;\;1 \cdot \mathsf{fma}\left(im \cdot im, -0.5, 1\right)\\ \mathbf{else}:\\ \;\;\;\;\left(1 + re\right) \cdot \left(0.5 - -0.5\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (exp re) (cos im)) 0.0)
   (* 1.0 (fma (* im im) -0.5 1.0))
   (* (+ 1.0 re) (- 0.5 -0.5))))

C

double code(double re, double im) {
	double tmp;
	if ((exp(re) * cos(im)) <= 0.0) {
		tmp = 1.0 * fma((im * im), -0.5, 1.0);
	} else {
		tmp = (1.0 + re) * (0.5 - -0.5);
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(exp(re) * cos(im)) <= 0.0)
		tmp = Float64(1.0 * fma(Float64(im * im), -0.5, 1.0));
	else
		tmp = Float64(Float64(1.0 + re) * Float64(0.5 - -0.5));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (cos.f64 im)) < 0.0

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

   4. Applied rewrites 62.8%

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

   6. Applied rewrites 62.8%

      \[\leadsto e^{re} \cdot \mathsf{fma}\left(im \cdot im, \color{blue}{-0.5}, 1\right) \]

   7. Taylor expanded in re around 0

      \[\leadsto \color{blue}{1} \cdot \mathsf{fma}\left(im \cdot im, \frac{-1}{2}, 1\right) \]

   9. Applied rewrites 29.9%

      \[\leadsto \color{blue}{1} \cdot \mathsf{fma}\left(im \cdot im, -0.5, 1\right) \]

   if 0.0 < (*.f64 (exp.f64 re) (cos.f64 im))

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

   4. Applied rewrites 62.8%

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

   6. Applied rewrites 62.8%

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

   7. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \left(\frac{1}{2} - \frac{-1}{2}\right) \]

   9. Applied rewrites 72.3%

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

   10. Taylor expanded in re around 0

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

   12. Applied rewrites 29.6%

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

Alternative 8: 29.6% accurate, 4.9× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

2. Taylor expanded in im around 0

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

4. Applied rewrites 62.8%

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

6. Applied rewrites 62.8%

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

7. Taylor expanded in im around 0

   \[\leadsto e^{re} \cdot \left(\frac{1}{2} - \frac{-1}{2}\right) \]

9. Applied rewrites 72.3%

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

10. Taylor expanded in re around 0

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

12. Applied rewrites 29.6%

    \[\leadsto \color{blue}{\left(1 + re\right)} \cdot \left(0.5 - -0.5\right) \]
13. Add Preprocessing

Reproduce

herbie shell --seed 2025161 
(FPCore (re im)
  :name "math.exp on complex, real part"
  :precision binary64
  (* (exp re) (cos im)))