math.cos on complex, real part

Percentage Accurate: 100.0% → 100.0%

Time: 3.5s

Alternatives: 17

Speedup: 1.2×

• 48.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 \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ \begin{array}{l} t_0 := \cos re \cdot 0.5\\ \mathsf{fma}\left(t\_0, e^{im\_m}, t\_0 \cdot e^{-im\_m}\right) \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (let* ((t_0 (* (cos re) 0.5))) (fma t_0 (exp im_m) (* t_0 (exp (- im_m))))))

C

im_m = fabs(im);
double code(double re, double im_m) {
	double t_0 = cos(re) * 0.5;
	return fma(t_0, exp(im_m), (t_0 * exp(-im_m)));
}

Julia

im_m = abs(im)
function code(re, im_m)
	t_0 = Float64(cos(re) * 0.5)
	return fma(t_0, exp(im_m), Float64(t_0 * exp(Float64(-im_m))))
end

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := Block[{t$95$0 = N[(N[Cos[re], $MachinePrecision] * 0.5), $MachinePrecision]}, N[(t$95$0 * N[Exp[im$95$m], $MachinePrecision] + N[(t$95$0 * N[Exp[(-im$95$m)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Initial program 100.0%

   \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
2. Step-by-step derivation

   1. lift-*.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lift-cos.f64 N/A

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

   4. lift-+.f64 N/A

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

   5. lift-exp.f64 N/A

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

   6. lift-neg.f64 N/A

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

   7. lift-exp.f64 N/A

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

   8. +-commutative N/A

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

   9. distribute-lft-in N/A

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

   10. lower-fma.f64 N/A

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

   11. *-commutative N/A

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

   12. lower-*.f64 N/A

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

   13. lift-cos.f64 N/A

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

   14. lift-exp.f64 N/A

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

   15. lower-*.f64 N/A

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

   16. *-commutative N/A

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

   17. lower-*.f64 N/A

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

   18. lift-cos.f64 N/A

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

   19. lift-neg.f64 N/A

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

   20. lift-exp.f64 100.0

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

3. Applied rewrites 100.0%

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

Alternative 2: 100.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ \left(\cos re \cdot 0.5\right) \cdot \left(2 \cdot \cosh im\_m\right) \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m) :precision binary64 (* (* (cos re) 0.5) (* 2.0 (cosh im_m))))

C

im_m = fabs(im);
double code(double re, double im_m) {
	return (cos(re) * 0.5) * (2.0 * cosh(im_m));
}

Fortran

im_m =     private
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_m)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    code = (cos(re) * 0.5d0) * (2.0d0 * cosh(im_m))
end function

Java

im_m = Math.abs(im);
public static double code(double re, double im_m) {
	return (Math.cos(re) * 0.5) * (2.0 * Math.cosh(im_m));
}

Python

im_m = math.fabs(im)
def code(re, im_m):
	return (math.cos(re) * 0.5) * (2.0 * math.cosh(im_m))

Julia

im_m = abs(im)
function code(re, im_m)
	return Float64(Float64(cos(re) * 0.5) * Float64(2.0 * cosh(im_m)))
end

MATLAB

im_m = abs(im);
function tmp = code(re, im_m)
	tmp = (cos(re) * 0.5) * (2.0 * cosh(im_m));
end

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := N[(N[(N[Cos[re], $MachinePrecision] * 0.5), $MachinePrecision] * N[(2.0 * N[Cosh[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right) \]
2. Step-by-step derivation

   1. lift-*.f64 N/A

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

   2. lift-cos.f64 N/A

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

   3. *-commutative N/A

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

   4. lower-*.f64 N/A

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

   5. lift-cos.f64 100.0

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

   6. lift-+.f64 N/A

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

   7. lift-exp.f64 N/A

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

   8. lift-neg.f64 N/A

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

   9. lift-exp.f64 N/A

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

   10. +-commutative N/A

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

   11. cosh-undef N/A

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

   12. lower-*.f64 N/A

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

   13. lower-cosh.f64 100.0

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

3. Applied rewrites 100.0%

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

Alternative 3: 99.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ \begin{array}{l} t_0 := 2 \cdot \cosh im\_m\\ t_1 := 0.5 \cdot \cos re\\ t_2 := t\_1 \cdot \left(e^{-im\_m} + e^{im\_m}\right)\\ \mathbf{if}\;t\_2 \leq -\infty:\\ \;\;\;\;t\_0 \cdot \left(\left(re \cdot re\right) \cdot -0.25\right)\\ \mathbf{elif}\;t\_2 \leq 0.9999999999997924:\\ \;\;\;\;t\_1 \cdot \mathsf{fma}\left(im\_m, im\_m, 2\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0 \cdot 0.5\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (let* ((t_0 (* 2.0 (cosh im_m)))
        (t_1 (* 0.5 (cos re)))
        (t_2 (* t_1 (+ (exp (- im_m)) (exp im_m)))))
   (if (<= t_2 (- INFINITY))
     (* t_0 (* (* re re) -0.25))
     (if (<= t_2 0.9999999999997924)
       (* t_1 (fma im_m im_m 2.0))
       (* t_0 0.5)))))

C

im_m = fabs(im);
double code(double re, double im_m) {
	double t_0 = 2.0 * cosh(im_m);
	double t_1 = 0.5 * cos(re);
	double t_2 = t_1 * (exp(-im_m) + exp(im_m));
	double tmp;
	if (t_2 <= -((double) INFINITY)) {
		tmp = t_0 * ((re * re) * -0.25);
	} else if (t_2 <= 0.9999999999997924) {
		tmp = t_1 * fma(im_m, im_m, 2.0);
	} else {
		tmp = t_0 * 0.5;
	}
	return tmp;
}

Julia

im_m = abs(im)
function code(re, im_m)
	t_0 = Float64(2.0 * cosh(im_m))
	t_1 = Float64(0.5 * cos(re))
	t_2 = Float64(t_1 * Float64(exp(Float64(-im_m)) + exp(im_m)))
	tmp = 0.0
	if (t_2 <= Float64(-Inf))
		tmp = Float64(t_0 * Float64(Float64(re * re) * -0.25));
	elseif (t_2 <= 0.9999999999997924)
		tmp = Float64(t_1 * fma(im_m, im_m, 2.0));
	else
		tmp = Float64(t_0 * 0.5);
	end
	return tmp
end

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := Block[{t$95$0 = N[(2.0 * N[Cosh[im$95$m], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * N[(N[Exp[(-im$95$m)], $MachinePrecision] + N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], N[(t$95$0 * N[(N[(re * re), $MachinePrecision] * -0.25), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 0.9999999999997924], N[(t$95$1 * N[(im$95$m * im$95$m + 2.0), $MachinePrecision]), $MachinePrecision], N[(t$95$0 * 0.5), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{-1}{4} \cdot \left({re}^{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)\right) + \frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. associate-*r* N/A

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

      3. distribute-rgt-out N/A

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

      4. lower-*.f64 N/A

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

      5. cosh-undef N/A

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

      6. lower-*.f64 N/A

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

      7. lower-cosh.f64 N/A

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

      8. +-commutative N/A

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

      9. *-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-*.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in re around inf

      \[\leadsto \left(2 \cdot \cosh im\right) \cdot \left(\frac{-1}{4} \cdot \color{blue}{{re}^{2}}\right) \]
   6. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. pow2 N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \left(\left(re \cdot re\right) \cdot \frac{-1}{4}\right) \]

      4. lift-*.f64 100.0

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \left(\left(re \cdot re\right) \cdot -0.25\right) \]

   7. Applied rewrites 100.0%

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

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

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

      \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(2 + {im}^{2}\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. unpow2 N/A

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

      3. lower-fma.f64 99.1

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

   4. Applied rewrites 99.1%

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

   if 0.99999999999979239 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)))

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. cosh-undef N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

      5. lower-cosh.f64 99.8

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot 0.5 \]

   4. Applied rewrites 99.8%

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

Alternative 4: 99.5% accurate, 0.4× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ \begin{array}{l} t_0 := 2 \cdot \cosh im\_m\\ t_1 := \left(0.5 \cdot \cos re\right) \cdot \left(e^{-im\_m} + e^{im\_m}\right)\\ \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;t\_0 \cdot \left(\left(re \cdot re\right) \cdot -0.25\right)\\ \mathbf{elif}\;t\_1 \leq 0.9999999999997924:\\ \;\;\;\;\cos re\\ \mathbf{else}:\\ \;\;\;\;t\_0 \cdot 0.5\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (let* ((t_0 (* 2.0 (cosh im_m)))
        (t_1 (* (* 0.5 (cos re)) (+ (exp (- im_m)) (exp im_m)))))
   (if (<= t_1 (- INFINITY))
     (* t_0 (* (* re re) -0.25))
     (if (<= t_1 0.9999999999997924) (cos re) (* t_0 0.5)))))

C

im_m = fabs(im);
double code(double re, double im_m) {
	double t_0 = 2.0 * cosh(im_m);
	double t_1 = (0.5 * cos(re)) * (exp(-im_m) + exp(im_m));
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = t_0 * ((re * re) * -0.25);
	} else if (t_1 <= 0.9999999999997924) {
		tmp = cos(re);
	} else {
		tmp = t_0 * 0.5;
	}
	return tmp;
}

Java

im_m = Math.abs(im);
public static double code(double re, double im_m) {
	double t_0 = 2.0 * Math.cosh(im_m);
	double t_1 = (0.5 * Math.cos(re)) * (Math.exp(-im_m) + Math.exp(im_m));
	double tmp;
	if (t_1 <= -Double.POSITIVE_INFINITY) {
		tmp = t_0 * ((re * re) * -0.25);
	} else if (t_1 <= 0.9999999999997924) {
		tmp = Math.cos(re);
	} else {
		tmp = t_0 * 0.5;
	}
	return tmp;
}

Python

im_m = math.fabs(im)
def code(re, im_m):
	t_0 = 2.0 * math.cosh(im_m)
	t_1 = (0.5 * math.cos(re)) * (math.exp(-im_m) + math.exp(im_m))
	tmp = 0
	if t_1 <= -math.inf:
		tmp = t_0 * ((re * re) * -0.25)
	elif t_1 <= 0.9999999999997924:
		tmp = math.cos(re)
	else:
		tmp = t_0 * 0.5
	return tmp

Julia

im_m = abs(im)
function code(re, im_m)
	t_0 = Float64(2.0 * cosh(im_m))
	t_1 = Float64(Float64(0.5 * cos(re)) * Float64(exp(Float64(-im_m)) + exp(im_m)))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(t_0 * Float64(Float64(re * re) * -0.25));
	elseif (t_1 <= 0.9999999999997924)
		tmp = cos(re);
	else
		tmp = Float64(t_0 * 0.5);
	end
	return tmp
end

MATLAB

im_m = abs(im);
function tmp_2 = code(re, im_m)
	t_0 = 2.0 * cosh(im_m);
	t_1 = (0.5 * cos(re)) * (exp(-im_m) + exp(im_m));
	tmp = 0.0;
	if (t_1 <= -Inf)
		tmp = t_0 * ((re * re) * -0.25);
	elseif (t_1 <= 0.9999999999997924)
		tmp = cos(re);
	else
		tmp = t_0 * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := Block[{t$95$0 = N[(2.0 * N[Cosh[im$95$m], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im$95$m)], $MachinePrecision] + N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(t$95$0 * N[(N[(re * re), $MachinePrecision] * -0.25), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.9999999999997924], N[Cos[re], $MachinePrecision], N[(t$95$0 * 0.5), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{-1}{4} \cdot \left({re}^{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)\right) + \frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. associate-*r* N/A

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

      3. distribute-rgt-out N/A

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

      4. lower-*.f64 N/A

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

      5. cosh-undef N/A

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

      6. lower-*.f64 N/A

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

      7. lower-cosh.f64 N/A

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

      8. +-commutative N/A

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

      9. *-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-*.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in re around inf

      \[\leadsto \left(2 \cdot \cosh im\right) \cdot \left(\frac{-1}{4} \cdot \color{blue}{{re}^{2}}\right) \]
   6. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. pow2 N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \left(\left(re \cdot re\right) \cdot \frac{-1}{4}\right) \]

      4. lift-*.f64 100.0

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \left(\left(re \cdot re\right) \cdot -0.25\right) \]

   7. Applied rewrites 100.0%

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

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

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

      \[\leadsto \color{blue}{\cos re} \]
   3. Step-by-step derivation

      1. lift-cos.f64 98.5

         \[\leadsto \cos re \]

   4. Applied rewrites 98.5%

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

   if 0.99999999999979239 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)))

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. cosh-undef N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

      5. lower-cosh.f64 99.8

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot 0.5 \]

   4. Applied rewrites 99.8%

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

Alternative 5: 98.9% accurate, 1.2× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ \left(0.5 \cdot \cos re\right) \cdot \left(1 + e^{im\_m}\right) \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m) :precision binary64 (* (* 0.5 (cos re)) (+ 1.0 (exp im_m))))

C

im_m = fabs(im);
double code(double re, double im_m) {
	return (0.5 * cos(re)) * (1.0 + exp(im_m));
}

Fortran

im_m =     private
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_m)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    code = (0.5d0 * cos(re)) * (1.0d0 + exp(im_m))
end function

Java

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

Python

im_m = math.fabs(im)
def code(re, im_m):
	return (0.5 * math.cos(re)) * (1.0 + math.exp(im_m))

Julia

im_m = abs(im)
function code(re, im_m)
	return Float64(Float64(0.5 * cos(re)) * Float64(1.0 + exp(im_m)))
end

MATLAB

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

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := N[(N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

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

2. Taylor expanded in im around 0

   \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(\color{blue}{1} + e^{im}\right) \]
3. Step-by-step derivation

4. Applied rewrites 98.9%

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

Alternative 6: 77.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ \begin{array}{l} t_0 := 2 \cdot \cosh im\_m\\ \mathbf{if}\;\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im\_m} + e^{im\_m}\right) \leq -0.05:\\ \;\;\;\;t\_0 \cdot \mathsf{fma}\left(re \cdot re, -0.25, 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0 \cdot 0.5\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (let* ((t_0 (* 2.0 (cosh im_m))))
   (if (<= (* (* 0.5 (cos re)) (+ (exp (- im_m)) (exp im_m))) -0.05)
     (* t_0 (fma (* re re) -0.25 0.5))
     (* t_0 0.5))))

C

im_m = fabs(im);
double code(double re, double im_m) {
	double t_0 = 2.0 * cosh(im_m);
	double tmp;
	if (((0.5 * cos(re)) * (exp(-im_m) + exp(im_m))) <= -0.05) {
		tmp = t_0 * fma((re * re), -0.25, 0.5);
	} else {
		tmp = t_0 * 0.5;
	}
	return tmp;
}

Julia

im_m = abs(im)
function code(re, im_m)
	t_0 = Float64(2.0 * cosh(im_m))
	tmp = 0.0
	if (Float64(Float64(0.5 * cos(re)) * Float64(exp(Float64(-im_m)) + exp(im_m))) <= -0.05)
		tmp = Float64(t_0 * fma(Float64(re * re), -0.25, 0.5));
	else
		tmp = Float64(t_0 * 0.5);
	end
	return tmp
end

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := Block[{t$95$0 = N[(2.0 * N[Cosh[im$95$m], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im$95$m)], $MachinePrecision] + N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.05], N[(t$95$0 * N[(N[(re * re), $MachinePrecision] * -0.25 + 0.5), $MachinePrecision]), $MachinePrecision], N[(t$95$0 * 0.5), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im))) < -0.050000000000000003

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{-1}{4} \cdot \left({re}^{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)\right) + \frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. associate-*r* N/A

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

      3. distribute-rgt-out N/A

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

      4. lower-*.f64 N/A

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

      5. cosh-undef N/A

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

      6. lower-*.f64 N/A

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

      7. lower-cosh.f64 N/A

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

      8. +-commutative N/A

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

      9. *-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-*.f64 51.9

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

   4. Applied rewrites 51.9%

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

   if -0.050000000000000003 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)))

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. cosh-undef N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

      5. lower-cosh.f64 85.4

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot 0.5 \]

   4. Applied rewrites 85.4%

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

Alternative 7: 77.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ \begin{array}{l} t_0 := 2 \cdot \cosh im\_m\\ \mathbf{if}\;\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im\_m} + e^{im\_m}\right) \leq -0.05:\\ \;\;\;\;t\_0 \cdot \left(\left(re \cdot re\right) \cdot -0.25\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0 \cdot 0.5\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (let* ((t_0 (* 2.0 (cosh im_m))))
   (if (<= (* (* 0.5 (cos re)) (+ (exp (- im_m)) (exp im_m))) -0.05)
     (* t_0 (* (* re re) -0.25))
     (* t_0 0.5))))

C

im_m = fabs(im);
double code(double re, double im_m) {
	double t_0 = 2.0 * cosh(im_m);
	double tmp;
	if (((0.5 * cos(re)) * (exp(-im_m) + exp(im_m))) <= -0.05) {
		tmp = t_0 * ((re * re) * -0.25);
	} else {
		tmp = t_0 * 0.5;
	}
	return tmp;
}

Fortran

im_m =     private
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_m)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: t_0
    real(8) :: tmp
    t_0 = 2.0d0 * cosh(im_m)
    if (((0.5d0 * cos(re)) * (exp(-im_m) + exp(im_m))) <= (-0.05d0)) then
        tmp = t_0 * ((re * re) * (-0.25d0))
    else
        tmp = t_0 * 0.5d0
    end if
    code = tmp
end function

Java

im_m = Math.abs(im);
public static double code(double re, double im_m) {
	double t_0 = 2.0 * Math.cosh(im_m);
	double tmp;
	if (((0.5 * Math.cos(re)) * (Math.exp(-im_m) + Math.exp(im_m))) <= -0.05) {
		tmp = t_0 * ((re * re) * -0.25);
	} else {
		tmp = t_0 * 0.5;
	}
	return tmp;
}

Python

im_m = math.fabs(im)
def code(re, im_m):
	t_0 = 2.0 * math.cosh(im_m)
	tmp = 0
	if ((0.5 * math.cos(re)) * (math.exp(-im_m) + math.exp(im_m))) <= -0.05:
		tmp = t_0 * ((re * re) * -0.25)
	else:
		tmp = t_0 * 0.5
	return tmp

Julia

im_m = abs(im)
function code(re, im_m)
	t_0 = Float64(2.0 * cosh(im_m))
	tmp = 0.0
	if (Float64(Float64(0.5 * cos(re)) * Float64(exp(Float64(-im_m)) + exp(im_m))) <= -0.05)
		tmp = Float64(t_0 * Float64(Float64(re * re) * -0.25));
	else
		tmp = Float64(t_0 * 0.5);
	end
	return tmp
end

MATLAB

im_m = abs(im);
function tmp_2 = code(re, im_m)
	t_0 = 2.0 * cosh(im_m);
	tmp = 0.0;
	if (((0.5 * cos(re)) * (exp(-im_m) + exp(im_m))) <= -0.05)
		tmp = t_0 * ((re * re) * -0.25);
	else
		tmp = t_0 * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := Block[{t$95$0 = N[(2.0 * N[Cosh[im$95$m], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im$95$m)], $MachinePrecision] + N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.05], N[(t$95$0 * N[(N[(re * re), $MachinePrecision] * -0.25), $MachinePrecision]), $MachinePrecision], N[(t$95$0 * 0.5), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im))) < -0.050000000000000003

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{-1}{4} \cdot \left({re}^{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)\right) + \frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. associate-*r* N/A

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

      3. distribute-rgt-out N/A

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

      4. lower-*.f64 N/A

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

      5. cosh-undef N/A

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

      6. lower-*.f64 N/A

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

      7. lower-cosh.f64 N/A

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

      8. +-commutative N/A

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

      9. *-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-*.f64 51.9

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

   4. Applied rewrites 51.9%

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

   5. Taylor expanded in re around inf

      \[\leadsto \left(2 \cdot \cosh im\right) \cdot \left(\frac{-1}{4} \cdot \color{blue}{{re}^{2}}\right) \]
   6. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. pow2 N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \left(\left(re \cdot re\right) \cdot \frac{-1}{4}\right) \]

      4. lift-*.f64 51.9

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \left(\left(re \cdot re\right) \cdot -0.25\right) \]

   7. Applied rewrites 51.9%

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

   if -0.050000000000000003 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)))

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. cosh-undef N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

      5. lower-cosh.f64 85.4

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot 0.5 \]

   4. Applied rewrites 85.4%

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

Alternative 8: 75.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ \begin{array}{l} \mathbf{if}\;\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im\_m} + e^{im\_m}\right) \leq -0.05:\\ \;\;\;\;\mathsf{fma}\left(re \cdot re, -0.25, 0.5\right) \cdot \mathsf{fma}\left(im\_m, im\_m, 2\right)\\ \mathbf{else}:\\ \;\;\;\;\left(2 \cdot \cosh im\_m\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (if (<= (* (* 0.5 (cos re)) (+ (exp (- im_m)) (exp im_m))) -0.05)
   (* (fma (* re re) -0.25 0.5) (fma im_m im_m 2.0))
   (* (* 2.0 (cosh im_m)) 0.5)))

C

im_m = fabs(im);
double code(double re, double im_m) {
	double tmp;
	if (((0.5 * cos(re)) * (exp(-im_m) + exp(im_m))) <= -0.05) {
		tmp = fma((re * re), -0.25, 0.5) * fma(im_m, im_m, 2.0);
	} else {
		tmp = (2.0 * cosh(im_m)) * 0.5;
	}
	return tmp;
}

Julia

im_m = abs(im)
function code(re, im_m)
	tmp = 0.0
	if (Float64(Float64(0.5 * cos(re)) * Float64(exp(Float64(-im_m)) + exp(im_m))) <= -0.05)
		tmp = Float64(fma(Float64(re * re), -0.25, 0.5) * fma(im_m, im_m, 2.0));
	else
		tmp = Float64(Float64(2.0 * cosh(im_m)) * 0.5);
	end
	return tmp
end

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := If[LessEqual[N[(N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im$95$m)], $MachinePrecision] + N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.05], N[(N[(N[(re * re), $MachinePrecision] * -0.25 + 0.5), $MachinePrecision] * N[(im$95$m * im$95$m + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * N[Cosh[im$95$m], $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im))) < -0.050000000000000003

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{-1}{4} \cdot \left({re}^{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)\right) + \frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. associate-*r* N/A

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

      3. distribute-rgt-out N/A

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

      4. lower-*.f64 N/A

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

      5. cosh-undef N/A

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

      6. lower-*.f64 N/A

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

      7. lower-cosh.f64 N/A

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

      8. +-commutative N/A

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

      9. *-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-*.f64 51.9

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

   4. Applied rewrites 51.9%

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

   5. Taylor expanded in im around 0

      \[\leadsto 2 \cdot \left(\frac{1}{2} + \frac{-1}{4} \cdot {re}^{2}\right) + \color{blue}{{im}^{2} \cdot \left(\frac{1}{2} + \frac{-1}{4} \cdot {re}^{2}\right)} \]
   6. Step-by-step derivation

      1. distribute-rgt-out N/A

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

      2. +-commutative N/A

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

      3. pow2 N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. pow2 N/A

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

      7. +-commutative N/A

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

      8. lift-fma.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. lift-fma.f64 46.8

          \[\leadsto \mathsf{fma}\left(re \cdot re, -0.25, 0.5\right) \cdot \mathsf{fma}\left(im, im, 2\right) \]

   7. Applied rewrites 46.8%

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

   if -0.050000000000000003 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)))

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. cosh-undef N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

      5. lower-cosh.f64 85.4

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot 0.5 \]

   4. Applied rewrites 85.4%

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

Alternative 9: 75.4% accurate, 0.8× speedup

Math

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

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (if (<= (* (* 0.5 (cos re)) (+ (exp (- im_m)) (exp im_m))) -0.05)
   (* (fma (* re re) -0.25 0.5) (fma im_m im_m 2.0))
   (* 0.5 (+ 1.0 (exp im_m)))))

C

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

Julia

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

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := If[LessEqual[N[(N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im$95$m)], $MachinePrecision] + N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.05], N[(N[(N[(re * re), $MachinePrecision] * -0.25 + 0.5), $MachinePrecision] * N[(im$95$m * im$95$m + 2.0), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(1.0 + N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im))) < -0.050000000000000003

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{-1}{4} \cdot \left({re}^{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)\right) + \frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. associate-*r* N/A

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

      3. distribute-rgt-out N/A

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

      4. lower-*.f64 N/A

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

      5. cosh-undef N/A

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

      6. lower-*.f64 N/A

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

      7. lower-cosh.f64 N/A

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

      8. +-commutative N/A

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

      9. *-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-*.f64 51.9

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

   4. Applied rewrites 51.9%

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

   5. Taylor expanded in im around 0

      \[\leadsto 2 \cdot \left(\frac{1}{2} + \frac{-1}{4} \cdot {re}^{2}\right) + \color{blue}{{im}^{2} \cdot \left(\frac{1}{2} + \frac{-1}{4} \cdot {re}^{2}\right)} \]
   6. Step-by-step derivation

      1. distribute-rgt-out N/A

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

      2. +-commutative N/A

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

      3. pow2 N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. pow2 N/A

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

      7. +-commutative N/A

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

      8. lift-fma.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. lift-fma.f64 46.8

          \[\leadsto \mathsf{fma}\left(re \cdot re, -0.25, 0.5\right) \cdot \mathsf{fma}\left(im, im, 2\right) \]

   7. Applied rewrites 46.8%

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

   if -0.050000000000000003 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)))

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

      \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(\color{blue}{1} + e^{im}\right) \]
   3. Step-by-step derivation

   4. Applied rewrites 99.0%

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

   5. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2}} \cdot \left(1 + e^{im}\right) \]
   6. Step-by-step derivation

   7. Applied rewrites 84.8%

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

Alternative 10: 75.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ \begin{array}{l} \mathbf{if}\;\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im\_m} + e^{im\_m}\right) \leq -0.2:\\ \;\;\;\;\left(0.5 \cdot \left(\left(re \cdot re\right) \cdot -0.5\right)\right) \cdot \left(im\_m \cdot im\_m\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(1 + e^{im\_m}\right)\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (if (<= (* (* 0.5 (cos re)) (+ (exp (- im_m)) (exp im_m))) -0.2)
   (* (* 0.5 (* (* re re) -0.5)) (* im_m im_m))
   (* 0.5 (+ 1.0 (exp im_m)))))

C

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

Fortran

im_m =     private
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_m)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (((0.5d0 * cos(re)) * (exp(-im_m) + exp(im_m))) <= (-0.2d0)) then
        tmp = (0.5d0 * ((re * re) * (-0.5d0))) * (im_m * im_m)
    else
        tmp = 0.5d0 * (1.0d0 + exp(im_m))
    end if
    code = tmp
end function

Java

im_m = Math.abs(im);
public static double code(double re, double im_m) {
	double tmp;
	if (((0.5 * Math.cos(re)) * (Math.exp(-im_m) + Math.exp(im_m))) <= -0.2) {
		tmp = (0.5 * ((re * re) * -0.5)) * (im_m * im_m);
	} else {
		tmp = 0.5 * (1.0 + Math.exp(im_m));
	}
	return tmp;
}

Python

im_m = math.fabs(im)
def code(re, im_m):
	tmp = 0
	if ((0.5 * math.cos(re)) * (math.exp(-im_m) + math.exp(im_m))) <= -0.2:
		tmp = (0.5 * ((re * re) * -0.5)) * (im_m * im_m)
	else:
		tmp = 0.5 * (1.0 + math.exp(im_m))
	return tmp

Julia

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

MATLAB

im_m = abs(im);
function tmp_2 = code(re, im_m)
	tmp = 0.0;
	if (((0.5 * cos(re)) * (exp(-im_m) + exp(im_m))) <= -0.2)
		tmp = (0.5 * ((re * re) * -0.5)) * (im_m * im_m);
	else
		tmp = 0.5 * (1.0 + exp(im_m));
	end
	tmp_2 = tmp;
end

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := If[LessEqual[N[(N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im$95$m)], $MachinePrecision] + N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.2], N[(N[(0.5 * N[(N[(re * re), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision] * N[(im$95$m * im$95$m), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(1.0 + N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im))) < -0.20000000000000001

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

      \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(2 + {im}^{2}\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. unpow2 N/A

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

      3. lower-fma.f64 75.4

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

   4. Applied rewrites 75.4%

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

   5. Taylor expanded in im around inf

      \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot {im}^{\color{blue}{2}} \]
   6. Step-by-step derivation

      1. pow2 N/A

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

      2. lower-*.f64 30.9

         \[\leadsto \left(0.5 \cdot \cos re\right) \cdot \left(im \cdot im\right) \]

   7. Applied rewrites 30.9%

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

   8. Taylor expanded in re around 0

      \[\leadsto \left(\frac{1}{2} \cdot \color{blue}{\left(1 + \frac{-1}{2} \cdot {re}^{2}\right)}\right) \cdot \left(im \cdot im\right) \]
   9. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. pow2 N/A

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

      5. lift-*.f64 48.8

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

   10. Applied rewrites 48.8%

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

   11. Taylor expanded in re around inf

       \[\leadsto \left(\frac{1}{2} \cdot \left(\frac{-1}{2} \cdot \color{blue}{{re}^{2}}\right)\right) \cdot \left(im \cdot im\right) \]
   12. Step-by-step derivation

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

       3. pow2 N/A

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

       4. lift-*.f64 48.8

          \[\leadsto \left(0.5 \cdot \left(\left(re \cdot re\right) \cdot -0.5\right)\right) \cdot \left(im \cdot im\right) \]

   13. Applied rewrites 48.8%

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

   if -0.20000000000000001 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)))

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

      \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \left(\color{blue}{1} + e^{im}\right) \]
   3. Step-by-step derivation

   4. Applied rewrites 99.0%

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

   5. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2}} \cdot \left(1 + e^{im}\right) \]
   6. Step-by-step derivation

   7. Applied rewrites 83.3%

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

Alternative 11: 66.8% accurate, 0.8× speedup

Math

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

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (if (<= (* (* 0.5 (cos re)) (+ (exp (- im_m)) (exp im_m))) -0.2)
   (* (* 0.5 (* (* re re) -0.5)) (* im_m im_m))
   (fma (* (* im_m im_m) 0.041666666666666664) (* im_m im_m) 1.0)))

C

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

Julia

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

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := If[LessEqual[N[(N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im$95$m)], $MachinePrecision] + N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.2], N[(N[(0.5 * N[(N[(re * re), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision] * N[(im$95$m * im$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(im$95$m * im$95$m), $MachinePrecision] * 0.041666666666666664), $MachinePrecision] * N[(im$95$m * im$95$m), $MachinePrecision] + 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im))) < -0.20000000000000001

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

      \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot \color{blue}{\left(2 + {im}^{2}\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. unpow2 N/A

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

      3. lower-fma.f64 75.4

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

   4. Applied rewrites 75.4%

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

   5. Taylor expanded in im around inf

      \[\leadsto \left(\frac{1}{2} \cdot \cos re\right) \cdot {im}^{\color{blue}{2}} \]
   6. Step-by-step derivation

      1. pow2 N/A

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

      2. lower-*.f64 30.9

         \[\leadsto \left(0.5 \cdot \cos re\right) \cdot \left(im \cdot im\right) \]

   7. Applied rewrites 30.9%

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

   8. Taylor expanded in re around 0

      \[\leadsto \left(\frac{1}{2} \cdot \color{blue}{\left(1 + \frac{-1}{2} \cdot {re}^{2}\right)}\right) \cdot \left(im \cdot im\right) \]
   9. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. pow2 N/A

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

      5. lift-*.f64 48.8

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

   10. Applied rewrites 48.8%

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

   11. Taylor expanded in re around inf

       \[\leadsto \left(\frac{1}{2} \cdot \left(\frac{-1}{2} \cdot \color{blue}{{re}^{2}}\right)\right) \cdot \left(im \cdot im\right) \]
   12. Step-by-step derivation

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

       3. pow2 N/A

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

       4. lift-*.f64 48.8

          \[\leadsto \left(0.5 \cdot \left(\left(re \cdot re\right) \cdot -0.5\right)\right) \cdot \left(im \cdot im\right) \]

   13. Applied rewrites 48.8%

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

   if -0.20000000000000001 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)))

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. cosh-undef N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

      5. lower-cosh.f64 83.9

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot 0.5 \]

   4. Applied rewrites 83.9%

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

   5. Taylor expanded in im around 0

      \[\leadsto 1 + \color{blue}{{im}^{2} \cdot \left(\frac{1}{2} + \frac{1}{24} \cdot {im}^{2}\right)} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto {im}^{2} \cdot \left(\frac{1}{2} + \frac{1}{24} \cdot {im}^{2}\right) + 1 \]

      2. *-commutative N/A

         \[\leadsto \left(\frac{1}{2} + \frac{1}{24} \cdot {im}^{2}\right) \cdot {im}^{2} + 1 \]

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{24} \cdot {im}^{2} + \frac{1}{2}, {im}^{2}, 1\right) \]

      5. *-commutative N/A

         \[\leadsto \mathsf{fma}\left({im}^{2} \cdot \frac{1}{24} + \frac{1}{2}, {im}^{2}, 1\right) \]

      6. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left({im}^{2}, \frac{1}{24}, \frac{1}{2}\right), {im}^{2}, 1\right) \]

      7. pow2 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(im \cdot im, \frac{1}{24}, \frac{1}{2}\right), {im}^{2}, 1\right) \]

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(im \cdot im, \frac{1}{24}, \frac{1}{2}\right), {im}^{2}, 1\right) \]

      9. pow2 N/A

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

      10. lower-*.f64 72.5

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

   7. Applied rewrites 72.5%

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

   8. Taylor expanded in im around inf

      \[\leadsto \mathsf{fma}\left(\frac{1}{24} \cdot {im}^{2}, im \cdot im, 1\right) \]
   9. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \mathsf{fma}\left({im}^{2} \cdot \frac{1}{24}, im \cdot im, 1\right) \]

      2. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left({im}^{2} \cdot \frac{1}{24}, im \cdot im, 1\right) \]

      3. pow2 N/A

         \[\leadsto \mathsf{fma}\left(\left(im \cdot im\right) \cdot \frac{1}{24}, im \cdot im, 1\right) \]

      4. lift-*.f64 72.3

         \[\leadsto \mathsf{fma}\left(\left(im \cdot im\right) \cdot 0.041666666666666664, im \cdot im, 1\right) \]

   10. Applied rewrites 72.3%

       \[\leadsto \mathsf{fma}\left(\left(im \cdot im\right) \cdot 0.041666666666666664, im \cdot im, 1\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 12: 62.8% accurate, 1.2× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ \begin{array}{l} \mathbf{if}\;0.5 \cdot \cos re \leq -0.01:\\ \;\;\;\;\mathsf{fma}\left(-0.5, re \cdot re, 1\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\left(im\_m \cdot im\_m\right) \cdot 0.041666666666666664, im\_m \cdot im\_m, 1\right)\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (if (<= (* 0.5 (cos re)) -0.01)
   (fma -0.5 (* re re) 1.0)
   (fma (* (* im_m im_m) 0.041666666666666664) (* im_m im_m) 1.0)))

C

im_m = fabs(im);
double code(double re, double im_m) {
	double tmp;
	if ((0.5 * cos(re)) <= -0.01) {
		tmp = fma(-0.5, (re * re), 1.0);
	} else {
		tmp = fma(((im_m * im_m) * 0.041666666666666664), (im_m * im_m), 1.0);
	}
	return tmp;
}

Julia

im_m = abs(im)
function code(re, im_m)
	tmp = 0.0
	if (Float64(0.5 * cos(re)) <= -0.01)
		tmp = fma(-0.5, Float64(re * re), 1.0);
	else
		tmp = fma(Float64(Float64(im_m * im_m) * 0.041666666666666664), Float64(im_m * im_m), 1.0);
	end
	return tmp
end

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := If[LessEqual[N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision], -0.01], N[(-0.5 * N[(re * re), $MachinePrecision] + 1.0), $MachinePrecision], N[(N[(N[(im$95$m * im$95$m), $MachinePrecision] * 0.041666666666666664), $MachinePrecision] * N[(im$95$m * im$95$m), $MachinePrecision] + 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

      \[\leadsto \color{blue}{\cos re} \]
   3. Step-by-step derivation

      1. lift-cos.f64 51.4

         \[\leadsto \cos re \]

   4. Applied rewrites 51.4%

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

   5. Taylor expanded in re around 0

      \[\leadsto 1 + \color{blue}{\frac{-1}{2} \cdot {re}^{2}} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \frac{-1}{2} \cdot {re}^{2} + 1 \]

      2. lower-fma.f64 N/A

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

      3. pow2 N/A

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

      4. lift-*.f64 29.5

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

   7. Applied rewrites 29.5%

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

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

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. cosh-undef N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

      5. lower-cosh.f64 85.4

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot 0.5 \]

   4. Applied rewrites 85.4%

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

   5. Taylor expanded in im around 0

      \[\leadsto 1 + \color{blue}{{im}^{2} \cdot \left(\frac{1}{2} + \frac{1}{24} \cdot {im}^{2}\right)} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto {im}^{2} \cdot \left(\frac{1}{2} + \frac{1}{24} \cdot {im}^{2}\right) + 1 \]

      2. *-commutative N/A

         \[\leadsto \left(\frac{1}{2} + \frac{1}{24} \cdot {im}^{2}\right) \cdot {im}^{2} + 1 \]

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{24} \cdot {im}^{2} + \frac{1}{2}, {im}^{2}, 1\right) \]

      5. *-commutative N/A

         \[\leadsto \mathsf{fma}\left({im}^{2} \cdot \frac{1}{24} + \frac{1}{2}, {im}^{2}, 1\right) \]

      6. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left({im}^{2}, \frac{1}{24}, \frac{1}{2}\right), {im}^{2}, 1\right) \]

      7. pow2 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(im \cdot im, \frac{1}{24}, \frac{1}{2}\right), {im}^{2}, 1\right) \]

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(im \cdot im, \frac{1}{24}, \frac{1}{2}\right), {im}^{2}, 1\right) \]

      9. pow2 N/A

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

      10. lower-*.f64 73.8

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

   7. Applied rewrites 73.8%

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

   8. Taylor expanded in im around inf

      \[\leadsto \mathsf{fma}\left(\frac{1}{24} \cdot {im}^{2}, im \cdot im, 1\right) \]
   9. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \mathsf{fma}\left({im}^{2} \cdot \frac{1}{24}, im \cdot im, 1\right) \]

      2. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left({im}^{2} \cdot \frac{1}{24}, im \cdot im, 1\right) \]

      3. pow2 N/A

         \[\leadsto \mathsf{fma}\left(\left(im \cdot im\right) \cdot \frac{1}{24}, im \cdot im, 1\right) \]

      4. lift-*.f64 73.6

         \[\leadsto \mathsf{fma}\left(\left(im \cdot im\right) \cdot 0.041666666666666664, im \cdot im, 1\right) \]

   10. Applied rewrites 73.6%

       \[\leadsto \mathsf{fma}\left(\left(im \cdot im\right) \cdot 0.041666666666666664, im \cdot im, 1\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 13: 62.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ \begin{array}{l} t_0 := \left(0.5 \cdot \cos re\right) \cdot \left(e^{-im\_m} + e^{im\_m}\right)\\ \mathbf{if}\;t\_0 \leq -0.05:\\ \;\;\;\;\mathsf{fma}\left(-0.5, re \cdot re, 1\right)\\ \mathbf{elif}\;t\_0 \leq 2:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\left(\left(im\_m \cdot im\_m\right) \cdot \left(im\_m \cdot im\_m\right)\right) \cdot 0.041666666666666664\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (let* ((t_0 (* (* 0.5 (cos re)) (+ (exp (- im_m)) (exp im_m)))))
   (if (<= t_0 -0.05)
     (fma -0.5 (* re re) 1.0)
     (if (<= t_0 2.0)
       1.0
       (* (* (* im_m im_m) (* im_m im_m)) 0.041666666666666664)))))

C

im_m = fabs(im);
double code(double re, double im_m) {
	double t_0 = (0.5 * cos(re)) * (exp(-im_m) + exp(im_m));
	double tmp;
	if (t_0 <= -0.05) {
		tmp = fma(-0.5, (re * re), 1.0);
	} else if (t_0 <= 2.0) {
		tmp = 1.0;
	} else {
		tmp = ((im_m * im_m) * (im_m * im_m)) * 0.041666666666666664;
	}
	return tmp;
}

Julia

im_m = abs(im)
function code(re, im_m)
	t_0 = Float64(Float64(0.5 * cos(re)) * Float64(exp(Float64(-im_m)) + exp(im_m)))
	tmp = 0.0
	if (t_0 <= -0.05)
		tmp = fma(-0.5, Float64(re * re), 1.0);
	elseif (t_0 <= 2.0)
		tmp = 1.0;
	else
		tmp = Float64(Float64(Float64(im_m * im_m) * Float64(im_m * im_m)) * 0.041666666666666664);
	end
	return tmp
end

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := Block[{t$95$0 = N[(N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im$95$m)], $MachinePrecision] + N[Exp[im$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -0.05], N[(-0.5 * N[(re * re), $MachinePrecision] + 1.0), $MachinePrecision], If[LessEqual[t$95$0, 2.0], 1.0, N[(N[(N[(im$95$m * im$95$m), $MachinePrecision] * N[(im$95$m * im$95$m), $MachinePrecision]), $MachinePrecision] * 0.041666666666666664), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im))) < -0.050000000000000003

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

      \[\leadsto \color{blue}{\cos re} \]
   3. Step-by-step derivation

      1. lift-cos.f64 50.7

         \[\leadsto \cos re \]

   4. Applied rewrites 50.7%

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

   5. Taylor expanded in re around 0

      \[\leadsto 1 + \color{blue}{\frac{-1}{2} \cdot {re}^{2}} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \frac{-1}{2} \cdot {re}^{2} + 1 \]

      2. lower-fma.f64 N/A

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

      3. pow2 N/A

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

      4. lift-*.f64 29.8

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

   7. Applied rewrites 29.8%

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

   if -0.050000000000000003 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im))) < 2

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. cosh-undef N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

      5. lower-cosh.f64 71.8

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot 0.5 \]

   4. Applied rewrites 71.8%

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

   5. Taylor expanded in im around 0

      \[\leadsto 1 \]
   6. Step-by-step derivation

   7. Applied rewrites 71.4%

      \[\leadsto 1 \]

   if 2 < (*.f64 (*.f64 #s(literal 1/2 binary64) (cos.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)))

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. cosh-undef N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

      5. lower-cosh.f64 99.8

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot 0.5 \]

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in im around 0

      \[\leadsto 1 + \color{blue}{{im}^{2} \cdot \left(\frac{1}{2} + \frac{1}{24} \cdot {im}^{2}\right)} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto {im}^{2} \cdot \left(\frac{1}{2} + \frac{1}{24} \cdot {im}^{2}\right) + 1 \]

      2. *-commutative N/A

         \[\leadsto \left(\frac{1}{2} + \frac{1}{24} \cdot {im}^{2}\right) \cdot {im}^{2} + 1 \]

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{24} \cdot {im}^{2} + \frac{1}{2}, {im}^{2}, 1\right) \]

      5. *-commutative N/A

         \[\leadsto \mathsf{fma}\left({im}^{2} \cdot \frac{1}{24} + \frac{1}{2}, {im}^{2}, 1\right) \]

      6. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left({im}^{2}, \frac{1}{24}, \frac{1}{2}\right), {im}^{2}, 1\right) \]

      7. pow2 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(im \cdot im, \frac{1}{24}, \frac{1}{2}\right), {im}^{2}, 1\right) \]

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(im \cdot im, \frac{1}{24}, \frac{1}{2}\right), {im}^{2}, 1\right) \]

      9. pow2 N/A

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

      10. lower-*.f64 75.9

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

   7. Applied rewrites 75.9%

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

   8. Taylor expanded in im around inf

      \[\leadsto \frac{1}{24} \cdot {im}^{\color{blue}{4}} \]
   9. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto {im}^{4} \cdot \frac{1}{24} \]

      2. lower-*.f64 N/A

         \[\leadsto {im}^{4} \cdot \frac{1}{24} \]

      3. metadata-eval N/A

         \[\leadsto {im}^{\left(2 + 2\right)} \cdot \frac{1}{24} \]

      4. pow-prod-up N/A

         \[\leadsto \left({im}^{2} \cdot {im}^{2}\right) \cdot \frac{1}{24} \]

      5. lower-*.f64 N/A

         \[\leadsto \left({im}^{2} \cdot {im}^{2}\right) \cdot \frac{1}{24} \]

      6. pow2 N/A

         \[\leadsto \left(\left(im \cdot im\right) \cdot {im}^{2}\right) \cdot \frac{1}{24} \]

      7. lift-*.f64 N/A

         \[\leadsto \left(\left(im \cdot im\right) \cdot {im}^{2}\right) \cdot \frac{1}{24} \]

      8. pow2 N/A

         \[\leadsto \left(\left(im \cdot im\right) \cdot \left(im \cdot im\right)\right) \cdot \frac{1}{24} \]

      9. lift-*.f64 76.0

         \[\leadsto \left(\left(im \cdot im\right) \cdot \left(im \cdot im\right)\right) \cdot 0.041666666666666664 \]

   10. Applied rewrites 76.0%

       \[\leadsto \left(\left(im \cdot im\right) \cdot \left(im \cdot im\right)\right) \cdot 0.041666666666666664 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 14: 54.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ \begin{array}{l} t_0 := 0.5 \cdot \cos re\\ \mathbf{if}\;t\_0 \leq -0.01:\\ \;\;\;\;\mathsf{fma}\left(-0.5, re \cdot re, 1\right)\\ \mathbf{elif}\;t\_0 \leq 0.4986:\\ \;\;\;\;\left(\left(re \cdot re\right) \cdot \left(re \cdot re\right)\right) \cdot 0.041666666666666664\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(im\_m \cdot im\_m, 0.5, 1\right)\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (let* ((t_0 (* 0.5 (cos re))))
   (if (<= t_0 -0.01)
     (fma -0.5 (* re re) 1.0)
     (if (<= t_0 0.4986)
       (* (* (* re re) (* re re)) 0.041666666666666664)
       (fma (* im_m im_m) 0.5 1.0)))))

C

im_m = fabs(im);
double code(double re, double im_m) {
	double t_0 = 0.5 * cos(re);
	double tmp;
	if (t_0 <= -0.01) {
		tmp = fma(-0.5, (re * re), 1.0);
	} else if (t_0 <= 0.4986) {
		tmp = ((re * re) * (re * re)) * 0.041666666666666664;
	} else {
		tmp = fma((im_m * im_m), 0.5, 1.0);
	}
	return tmp;
}

Julia

im_m = abs(im)
function code(re, im_m)
	t_0 = Float64(0.5 * cos(re))
	tmp = 0.0
	if (t_0 <= -0.01)
		tmp = fma(-0.5, Float64(re * re), 1.0);
	elseif (t_0 <= 0.4986)
		tmp = Float64(Float64(Float64(re * re) * Float64(re * re)) * 0.041666666666666664);
	else
		tmp = fma(Float64(im_m * im_m), 0.5, 1.0);
	end
	return tmp
end

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := Block[{t$95$0 = N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -0.01], N[(-0.5 * N[(re * re), $MachinePrecision] + 1.0), $MachinePrecision], If[LessEqual[t$95$0, 0.4986], N[(N[(N[(re * re), $MachinePrecision] * N[(re * re), $MachinePrecision]), $MachinePrecision] * 0.041666666666666664), $MachinePrecision], N[(N[(im$95$m * im$95$m), $MachinePrecision] * 0.5 + 1.0), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

      \[\leadsto \color{blue}{\cos re} \]
   3. Step-by-step derivation

      1. lift-cos.f64 51.4

         \[\leadsto \cos re \]

   4. Applied rewrites 51.4%

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

   5. Taylor expanded in re around 0

      \[\leadsto 1 + \color{blue}{\frac{-1}{2} \cdot {re}^{2}} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \frac{-1}{2} \cdot {re}^{2} + 1 \]

      2. lower-fma.f64 N/A

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

      3. pow2 N/A

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

      4. lift-*.f64 29.5

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

   7. Applied rewrites 29.5%

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

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

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

      \[\leadsto \color{blue}{\cos re} \]
   3. Step-by-step derivation

      1. lift-cos.f64 52.9

         \[\leadsto \cos re \]

   4. Applied rewrites 52.9%

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

   5. Taylor expanded in re around 0

      \[\leadsto 1 + \color{blue}{{re}^{2} \cdot \left(\frac{1}{24} \cdot {re}^{2} - \frac{1}{2}\right)} \]
   6. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. negate-sub N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{24} \cdot {re}^{2} + \left(\mathsf{neg}\left(\frac{1}{2}\right)\right), {re}^{2}, 1\right) \]

      5. metadata-eval N/A

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

      6. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{24}, {re}^{2}, \frac{-1}{2}\right), {re}^{2}, 1\right) \]

      7. pow2 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{24}, re \cdot re, \frac{-1}{2}\right), {re}^{2}, 1\right) \]

      8. lift-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{24}, re \cdot re, \frac{-1}{2}\right), {re}^{2}, 1\right) \]

      9. pow2 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{24}, re \cdot re, \frac{-1}{2}\right), re \cdot re, 1\right) \]

      10. lift-*.f64 38.2

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

   7. Applied rewrites 38.2%

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

   8. Taylor expanded in re around inf

      \[\leadsto \frac{1}{24} \cdot {re}^{\color{blue}{4}} \]
   9. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto {re}^{4} \cdot \frac{1}{24} \]

      2. lower-*.f64 N/A

         \[\leadsto {re}^{4} \cdot \frac{1}{24} \]

      3. metadata-eval N/A

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

      4. pow-prod-up N/A

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

      5. lower-*.f64 N/A

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

      6. pow2 N/A

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

      7. lift-*.f64 N/A

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

      8. pow2 N/A

         \[\leadsto \left(\left(re \cdot re\right) \cdot \left(re \cdot re\right)\right) \cdot \frac{1}{24} \]

      9. lift-*.f64 38.0

         \[\leadsto \left(\left(re \cdot re\right) \cdot \left(re \cdot re\right)\right) \cdot 0.041666666666666664 \]

   10. Applied rewrites 38.0%

       \[\leadsto \left(\left(re \cdot re\right) \cdot \left(re \cdot re\right)\right) \cdot 0.041666666666666664 \]

   if 0.498599999999999988 < (*.f64 #s(literal 1/2 binary64) (cos.f64 re))

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. cosh-undef N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

      5. lower-cosh.f64 98.8

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot 0.5 \]

   4. Applied rewrites 98.8%

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

   5. Taylor expanded in im around 0

      \[\leadsto 1 + \color{blue}{\frac{1}{2} \cdot {im}^{2}} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \frac{1}{2} \cdot {im}^{2} + 1 \]

      2. *-commutative N/A

         \[\leadsto {im}^{2} \cdot \frac{1}{2} + 1 \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left({im}^{2}, \frac{1}{2}, 1\right) \]

      4. pow2 N/A

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

      5. lower-*.f64 75.1

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

   7. Applied rewrites 75.1%

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

Alternative 15: 54.0% accurate, 1.3× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ \begin{array}{l} \mathbf{if}\;0.5 \cdot \cos re \leq -0.01:\\ \;\;\;\;\mathsf{fma}\left(-0.5, re \cdot re, 1\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(im\_m \cdot im\_m, 0.5, 1\right)\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (if (<= (* 0.5 (cos re)) -0.01)
   (fma -0.5 (* re re) 1.0)
   (fma (* im_m im_m) 0.5 1.0)))

C

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

Julia

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

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := If[LessEqual[N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision], -0.01], N[(-0.5 * N[(re * re), $MachinePrecision] + 1.0), $MachinePrecision], N[(N[(im$95$m * im$95$m), $MachinePrecision] * 0.5 + 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

      \[\leadsto \color{blue}{\cos re} \]
   3. Step-by-step derivation

      1. lift-cos.f64 51.4

         \[\leadsto \cos re \]

   4. Applied rewrites 51.4%

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

   5. Taylor expanded in re around 0

      \[\leadsto 1 + \color{blue}{\frac{-1}{2} \cdot {re}^{2}} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \frac{-1}{2} \cdot {re}^{2} + 1 \]

      2. lower-fma.f64 N/A

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

      3. pow2 N/A

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

      4. lift-*.f64 29.5

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

   7. Applied rewrites 29.5%

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

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

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. cosh-undef N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

      5. lower-cosh.f64 85.4

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot 0.5 \]

   4. Applied rewrites 85.4%

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

   5. Taylor expanded in im around 0

      \[\leadsto 1 + \color{blue}{\frac{1}{2} \cdot {im}^{2}} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \frac{1}{2} \cdot {im}^{2} + 1 \]

      2. *-commutative N/A

         \[\leadsto {im}^{2} \cdot \frac{1}{2} + 1 \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left({im}^{2}, \frac{1}{2}, 1\right) \]

      4. pow2 N/A

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

      5. lower-*.f64 62.1

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

   7. Applied rewrites 62.1%

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

Alternative 16: 36.2% accurate, 1.3× speedup

Math

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

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (if (<= (* 0.5 (cos re)) -0.01) (fma -0.5 (* re re) 1.0) 1.0))

C

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

Julia

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

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := If[LessEqual[N[(0.5 * N[Cos[re], $MachinePrecision]), $MachinePrecision], -0.01], N[(-0.5 * N[(re * re), $MachinePrecision] + 1.0), $MachinePrecision], 1.0]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

   2. Taylor expanded in im around 0

      \[\leadsto \color{blue}{\cos re} \]
   3. Step-by-step derivation

      1. lift-cos.f64 51.4

         \[\leadsto \cos re \]

   4. Applied rewrites 51.4%

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

   5. Taylor expanded in re around 0

      \[\leadsto 1 + \color{blue}{\frac{-1}{2} \cdot {re}^{2}} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \frac{-1}{2} \cdot {re}^{2} + 1 \]

      2. lower-fma.f64 N/A

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

      3. pow2 N/A

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

      4. lift-*.f64 29.5

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

   7. Applied rewrites 29.5%

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

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

   1. Initial program 100.0%

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

   2. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. cosh-undef N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

      5. lower-cosh.f64 85.4

         \[\leadsto \left(2 \cdot \cosh im\right) \cdot 0.5 \]

   4. Applied rewrites 85.4%

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

   5. Taylor expanded in im around 0

      \[\leadsto 1 \]
   6. Step-by-step derivation

   7. Applied rewrites 38.4%

      \[\leadsto 1 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 17: 29.1% accurate, 62.8× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ 1 \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m) :precision binary64 1.0)

C

im_m = fabs(im);
double code(double re, double im_m) {
	return 1.0;
}

Fortran

im_m =     private
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_m)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    code = 1.0d0
end function

Java

im_m = Math.abs(im);
public static double code(double re, double im_m) {
	return 1.0;
}

Python

im_m = math.fabs(im)
def code(re, im_m):
	return 1.0

Julia

im_m = abs(im)
function code(re, im_m)
	return 1.0
end

MATLAB

im_m = abs(im);
function tmp = code(re, im_m)
	tmp = 1.0;
end

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := 1.0

Derivation

1. Initial program 100.0%

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

2. Taylor expanded in re around 0

   \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(e^{im} + e^{\mathsf{neg}\left(im\right)}\right)} \]
3. Step-by-step derivation

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. cosh-undef N/A

      \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

   4. lower-*.f64 N/A

      \[\leadsto \left(2 \cdot \cosh im\right) \cdot \frac{1}{2} \]

   5. lower-cosh.f64 64.4

      \[\leadsto \left(2 \cdot \cosh im\right) \cdot 0.5 \]

4. Applied rewrites 64.4%

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

5. Taylor expanded in im around 0

   \[\leadsto 1 \]
6. Step-by-step derivation

7. Applied rewrites 29.1%

   \[\leadsto 1 \]
8. Add Preprocessing

Reproduce

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