math.sin on complex, real part

Percentage Accurate: 100.0% → 100.0%

Time: 9.1s

Alternatives: 10

Speedup: 1.2×

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

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 = (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

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 = (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.2× speedup

Math

\[\begin{array}{l} \\ \left(\left(\sin re \cdot 2\right) \cdot \cosh im\right) \cdot 0.5 \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (* (* (* (sin re) 2.0) (cosh im)) 0.5))

C

double code(double re, double im) {
	return ((sin(re) * 2.0) * cosh(im)) * 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 = ((sin(re) * 2.0d0) * cosh(im)) * 0.5d0
end function

Java

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

Python

def code(re, im):
	return ((math.sin(re) * 2.0) * math.cosh(im)) * 0.5

Julia

function code(re, im)
	return Float64(Float64(Float64(sin(re) * 2.0) * cosh(im)) * 0.5)
end

MATLAB

function tmp = code(re, im)
	tmp = ((sin(re) * 2.0) * cosh(im)) * 0.5;
end

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Applied rewrites 100.0%

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

5. Applied rewrites 100.0%

   \[\leadsto \color{blue}{\left(\left(\sin re \cdot 2\right) \cdot \cosh im\right)} \cdot 0.5 \]
6. Add Preprocessing

Alternative 2: 77.8% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(0.5 \cdot \sin re\right) \cdot \left(e^{0 - im} + e^{im}\right)\\ \mathbf{if}\;t\_0 \leq -\infty:\\ \;\;\;\;\left(\left(\cosh im \cdot 2\right) \cdot \mathsf{fma}\left(\left(re \cdot re\right) \cdot re, -0.16666666666666666, re\right)\right) \cdot 0.5\\ \mathbf{elif}\;t\_0 \leq 1:\\ \;\;\;\;\left(\sin re \cdot 0.5\right) \cdot 2\\ \mathbf{else}:\\ \;\;\;\;\left(0.5 \cdot re\right) \cdot \left(1 + e^{im}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (* 0.5 (sin re)) (+ (exp (- 0.0 im)) (exp im)))))
   (if (<= t_0 (- INFINITY))
     (*
      (* (* (cosh im) 2.0) (fma (* (* re re) re) -0.16666666666666666 re))
      0.5)
     (if (<= t_0 1.0)
       (* (* (sin re) 0.5) 2.0)
       (* (* 0.5 re) (+ 1.0 (exp im)))))))

C

double code(double re, double im) {
	double t_0 = (0.5 * sin(re)) * (exp((0.0 - im)) + exp(im));
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = ((cosh(im) * 2.0) * fma(((re * re) * re), -0.16666666666666666, re)) * 0.5;
	} else if (t_0 <= 1.0) {
		tmp = (sin(re) * 0.5) * 2.0;
	} else {
		tmp = (0.5 * re) * (1.0 + exp(im));
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(Float64(0.5 * sin(re)) * Float64(exp(Float64(0.0 - im)) + exp(im)))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(Float64(Float64(cosh(im) * 2.0) * fma(Float64(Float64(re * re) * re), -0.16666666666666666, re)) * 0.5);
	elseif (t_0 <= 1.0)
		tmp = Float64(Float64(sin(re) * 0.5) * 2.0);
	else
		tmp = Float64(Float64(0.5 * re) * Float64(1.0 + exp(im)));
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[N[(0.0 - im), $MachinePrecision]], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[(N[(N[Cosh[im], $MachinePrecision] * 2.0), $MachinePrecision] * N[(N[(N[(re * re), $MachinePrecision] * re), $MachinePrecision] * -0.16666666666666666 + re), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[t$95$0, 1.0], N[(N[(N[Sin[re], $MachinePrecision] * 0.5), $MachinePrecision] * 2.0), $MachinePrecision], N[(N[(0.5 * re), $MachinePrecision] * N[(1.0 + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -inf.0

   1. Initial program 100.0%

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

   3. Applied rewrites 100.0%

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

   4. Taylor expanded in re around 0

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

   6. Applied rewrites 62.8%

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

   8. Applied rewrites 62.8%

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

   if -inf.0 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < 1

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

   4. Applied rewrites 50.9%

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

   6. Applied rewrites 50.9%

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

   if 1 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)))

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

   4. Applied rewrites 74.9%

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

   5. Taylor expanded in re around 0

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

   7. Applied rewrites 43.8%

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

Alternative 3: 74.9% accurate, 1.2× speedup

Math

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

FPCore

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

C

double code(double re, double im) {
	return (0.5 * sin(re)) * (1.0 + exp(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 = (0.5d0 * sin(re)) * (1.0d0 + exp(im))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[re_, im_] := N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(1.0 + 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. Taylor expanded in im around 0

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

4. Applied rewrites 74.9%

   \[\leadsto \left(0.5 \cdot \sin re\right) \cdot \left(\color{blue}{1} + e^{im}\right) \]
5. Add Preprocessing

Alternative 4: 60.0% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (* 0.5 (sin re)) (+ (exp (- 0.0 im)) (exp im))) 0.1)
   (* (* (* (cosh im) 2.0) (fma (* (* re re) re) -0.16666666666666666 re)) 0.5)
   (* (* 0.5 re) (+ 1.0 (exp im)))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < 0.10000000000000001

   1. Initial program 100.0%

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

   3. Applied rewrites 100.0%

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

   4. Taylor expanded in re around 0

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

   6. Applied rewrites 62.8%

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

   8. Applied rewrites 62.8%

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

   if 0.10000000000000001 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)))

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

   4. Applied rewrites 74.9%

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

   5. Taylor expanded in re around 0

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

   7. Applied rewrites 43.8%

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

Alternative 5: 53.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left(0.5 \cdot \sin re\right) \cdot \left(e^{0 - im} + e^{im}\right) \leq -0.04:\\ \;\;\;\;\left(re \cdot \left(0.5 + -0.08333333333333333 \cdot \sqrt{\left(re \cdot re\right) \cdot \left(re \cdot re\right)}\right)\right) \cdot 2\\ \mathbf{else}:\\ \;\;\;\;\left(\left(re + re\right) \cdot \cosh im\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (* 0.5 (sin re)) (+ (exp (- 0.0 im)) (exp im))) -0.04)
   (*
    (* re (+ 0.5 (* -0.08333333333333333 (sqrt (* (* re re) (* re re))))))
    2.0)
   (* (* (+ re re) (cosh im)) 0.5)))

C

double code(double re, double im) {
	double tmp;
	if (((0.5 * sin(re)) * (exp((0.0 - im)) + exp(im))) <= -0.04) {
		tmp = (re * (0.5 + (-0.08333333333333333 * sqrt(((re * re) * (re * re)))))) * 2.0;
	} else {
		tmp = ((re + re) * cosh(im)) * 0.5;
	}
	return tmp;
}

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
    real(8) :: tmp
    if (((0.5d0 * sin(re)) * (exp((0.0d0 - im)) + exp(im))) <= (-0.04d0)) then
        tmp = (re * (0.5d0 + ((-0.08333333333333333d0) * sqrt(((re * re) * (re * re)))))) * 2.0d0
    else
        tmp = ((re + re) * cosh(im)) * 0.5d0
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (((0.5 * Math.sin(re)) * (Math.exp((0.0 - im)) + Math.exp(im))) <= -0.04) {
		tmp = (re * (0.5 + (-0.08333333333333333 * Math.sqrt(((re * re) * (re * re)))))) * 2.0;
	} else {
		tmp = ((re + re) * Math.cosh(im)) * 0.5;
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if ((0.5 * math.sin(re)) * (math.exp((0.0 - im)) + math.exp(im))) <= -0.04:
		tmp = (re * (0.5 + (-0.08333333333333333 * math.sqrt(((re * re) * (re * re)))))) * 2.0
	else:
		tmp = ((re + re) * math.cosh(im)) * 0.5
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(Float64(0.5 * sin(re)) * Float64(exp(Float64(0.0 - im)) + exp(im))) <= -0.04)
		tmp = Float64(Float64(re * Float64(0.5 + Float64(-0.08333333333333333 * sqrt(Float64(Float64(re * re) * Float64(re * re)))))) * 2.0);
	else
		tmp = Float64(Float64(Float64(re + re) * cosh(im)) * 0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (((0.5 * sin(re)) * (exp((0.0 - im)) + exp(im))) <= -0.04)
		tmp = (re * (0.5 + (-0.08333333333333333 * sqrt(((re * re) * (re * re)))))) * 2.0;
	else
		tmp = ((re + re) * cosh(im)) * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[N[(0.0 - im), $MachinePrecision]], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.04], N[(N[(re * N[(0.5 + N[(-0.08333333333333333 * N[Sqrt[N[(N[(re * re), $MachinePrecision] * N[(re * re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision], N[(N[(N[(re + re), $MachinePrecision] * N[Cosh[im], $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -0.0400000000000000008

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

   4. Applied rewrites 50.9%

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

   5. Taylor expanded in re around 0

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

   7. Applied rewrites 33.9%

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

   9. Applied rewrites 34.8%

      \[\leadsto \left(re \cdot \left(0.5 + -0.08333333333333333 \cdot \sqrt{\left(re \cdot re\right) \cdot \left(re \cdot re\right)}\right)\right) \cdot 2 \]

   if -0.0400000000000000008 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)))

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

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

   4. Applied rewrites 62.0%

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

   6. Applied rewrites 62.0%

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

Alternative 6: 48.8% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;0.5 \cdot \sin re \leq -0.01:\\ \;\;\;\;\left(re \cdot \mathsf{fma}\left(re \cdot re, -0.08333333333333333, 0.5\right)\right) \cdot 2\\ \mathbf{else}:\\ \;\;\;\;\left(\left(re + re\right) \cdot \cosh im\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* 0.5 (sin re)) -0.01)
   (* (* re (fma (* re re) -0.08333333333333333 0.5)) 2.0)
   (* (* (+ re re) (cosh im)) 0.5)))

C

double code(double re, double im) {
	double tmp;
	if ((0.5 * sin(re)) <= -0.01) {
		tmp = (re * fma((re * re), -0.08333333333333333, 0.5)) * 2.0;
	} else {
		tmp = ((re + re) * cosh(im)) * 0.5;
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(0.5 * sin(re)) <= -0.01)
		tmp = Float64(Float64(re * fma(Float64(re * re), -0.08333333333333333, 0.5)) * 2.0);
	else
		tmp = Float64(Float64(Float64(re + re) * cosh(im)) * 0.5);
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision], -0.01], N[(N[(re * N[(N[(re * re), $MachinePrecision] * -0.08333333333333333 + 0.5), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision], N[(N[(N[(re + re), $MachinePrecision] * N[Cosh[im], $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) < -0.0100000000000000002

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

   4. Applied rewrites 50.9%

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

   5. Taylor expanded in re around 0

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

   7. Applied rewrites 33.9%

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

   9. Applied rewrites 33.9%

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

   if -0.0100000000000000002 < (*.f64 #s(literal 1/2 binary64) (sin.f64 re))

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

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

   4. Applied rewrites 62.0%

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

   6. Applied rewrites 62.0%

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

Alternative 7: 39.4% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (* 0.5 (sin re)) (+ (exp (- 0.0 im)) (exp im))) 0.1)
   (* (* re (fma (* re re) -0.08333333333333333 0.5)) 2.0)
   (* (* 0.5 re) (+ 1.0 (exp im)))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < 0.10000000000000001

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

   4. Applied rewrites 50.9%

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

   5. Taylor expanded in re around 0

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

   7. Applied rewrites 33.9%

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

   9. Applied rewrites 33.9%

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

   if 0.10000000000000001 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)))

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

   4. Applied rewrites 74.9%

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

   5. Taylor expanded in re around 0

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

   7. Applied rewrites 43.8%

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

Alternative 8: 33.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (* 0.5 (sin re)) (+ (exp (- 0.0 im)) (exp im))) 0.1)
   (* (* re (fma (* re re) -0.08333333333333333 0.5)) 2.0)
   (* (* 0.5 re) (+ 1.0 (+ 1.0 im)))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < 0.10000000000000001

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

   4. Applied rewrites 50.9%

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

   5. Taylor expanded in re around 0

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

   7. Applied rewrites 33.9%

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

   9. Applied rewrites 33.9%

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

   if 0.10000000000000001 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)))

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

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

   4. Applied rewrites 74.9%

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

   5. Taylor expanded in re around 0

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

   7. Applied rewrites 43.8%

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

   8. Taylor expanded in im around 0

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

   10. Applied rewrites 31.7%

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

Alternative 9: 31.7% accurate, 5.2× speedup

Math

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

FPCore

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

C

double code(double re, double im) {
	return (0.5 * re) * (1.0 + (1.0 + 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 = (0.5d0 * re) * (1.0d0 + (1.0d0 + im))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[re_, im_] := N[(N[(0.5 * re), $MachinePrecision] * N[(1.0 + N[(1.0 + 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. Taylor expanded in im around 0

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

4. Applied rewrites 74.9%

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

5. Taylor expanded in re around 0

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

7. Applied rewrites 43.8%

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

8. Taylor expanded in im around 0

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

10. Applied rewrites 31.7%

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

Alternative 10: 26.2% accurate, 9.3× speedup

Math

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

FPCore

(FPCore (re im) :precision binary64 (* (* 0.5 re) 2.0))

C

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

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 = (0.5d0 * re) * 2.0d0
end function

Java

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

Python

def code(re, im):
	return (0.5 * re) * 2.0

Julia

function code(re, im)
	return Float64(Float64(0.5 * re) * 2.0)
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

2. Taylor expanded in im around 0

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

4. Applied rewrites 50.9%

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

5. Taylor expanded in re around 0

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

7. Applied rewrites 26.2%

   \[\leadsto \left(0.5 \cdot \color{blue}{re}\right) \cdot 2 \]
8. Add Preprocessing

Reproduce

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