_divideComplex, real part

Percentage Accurate: 61.5% → 82.2%

Time: 3.4s

Alternatives: 6

Speedup: 1.8×

Specification

Math

\[\begin{array}{l} \\ \frac{x.re \cdot y.re + x.im \cdot y.im}{y.re \cdot y.re + y.im \cdot y.im} \end{array} \]

FPCore

(FPCore (x.re x.im y.re y.im)
 :precision binary64
 (/ (+ (* x.re y.re) (* x.im y.im)) (+ (* y.re y.re) (* y.im y.im))))

C

double code(double x_46_re, double x_46_im, double y_46_re, double y_46_im) {
	return ((x_46_re * y_46_re) + (x_46_im * y_46_im)) / ((y_46_re * y_46_re) + (y_46_im * y_46_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(x_46re, x_46im, y_46re, y_46im)
use fmin_fmax_functions
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im
    real(8), intent (in) :: y_46re
    real(8), intent (in) :: y_46im
    code = ((x_46re * y_46re) + (x_46im * y_46im)) / ((y_46re * y_46re) + (y_46im * y_46im))
end function

Java

public static double code(double x_46_re, double x_46_im, double y_46_re, double y_46_im) {
	return ((x_46_re * y_46_re) + (x_46_im * y_46_im)) / ((y_46_re * y_46_re) + (y_46_im * y_46_im));
}

Python

def code(x_46_re, x_46_im, y_46_re, y_46_im):
	return ((x_46_re * y_46_re) + (x_46_im * y_46_im)) / ((y_46_re * y_46_re) + (y_46_im * y_46_im))

Julia

function code(x_46_re, x_46_im, y_46_re, y_46_im)
	return Float64(Float64(Float64(x_46_re * y_46_re) + Float64(x_46_im * y_46_im)) / Float64(Float64(y_46_re * y_46_re) + Float64(y_46_im * y_46_im)))
end

MATLAB

function tmp = code(x_46_re, x_46_im, y_46_re, y_46_im)
	tmp = ((x_46_re * y_46_re) + (x_46_im * y_46_im)) / ((y_46_re * y_46_re) + (y_46_im * y_46_im));
end

Wolfram

code[x$46$re_, x$46$im_, y$46$re_, y$46$im_] := N[(N[(N[(x$46$re * y$46$re), $MachinePrecision] + N[(x$46$im * y$46$im), $MachinePrecision]), $MachinePrecision] / N[(N[(y$46$re * y$46$re), $MachinePrecision] + N[(y$46$im * y$46$im), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 61.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x.re \cdot y.re + x.im \cdot y.im}{y.re \cdot y.re + y.im \cdot y.im} \end{array} \]

FPCore

(FPCore (x.re x.im y.re y.im)
 :precision binary64
 (/ (+ (* x.re y.re) (* x.im y.im)) (+ (* y.re y.re) (* y.im y.im))))

C

double code(double x_46_re, double x_46_im, double y_46_re, double y_46_im) {
	return ((x_46_re * y_46_re) + (x_46_im * y_46_im)) / ((y_46_re * y_46_re) + (y_46_im * y_46_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(x_46re, x_46im, y_46re, y_46im)
use fmin_fmax_functions
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im
    real(8), intent (in) :: y_46re
    real(8), intent (in) :: y_46im
    code = ((x_46re * y_46re) + (x_46im * y_46im)) / ((y_46re * y_46re) + (y_46im * y_46im))
end function

Java

public static double code(double x_46_re, double x_46_im, double y_46_re, double y_46_im) {
	return ((x_46_re * y_46_re) + (x_46_im * y_46_im)) / ((y_46_re * y_46_re) + (y_46_im * y_46_im));
}

Python

def code(x_46_re, x_46_im, y_46_re, y_46_im):
	return ((x_46_re * y_46_re) + (x_46_im * y_46_im)) / ((y_46_re * y_46_re) + (y_46_im * y_46_im))

Julia

function code(x_46_re, x_46_im, y_46_re, y_46_im)
	return Float64(Float64(Float64(x_46_re * y_46_re) + Float64(x_46_im * y_46_im)) / Float64(Float64(y_46_re * y_46_re) + Float64(y_46_im * y_46_im)))
end

MATLAB

function tmp = code(x_46_re, x_46_im, y_46_re, y_46_im)
	tmp = ((x_46_re * y_46_re) + (x_46_im * y_46_im)) / ((y_46_re * y_46_re) + (y_46_im * y_46_im));
end

Wolfram

code[x$46$re_, x$46$im_, y$46$re_, y$46$im_] := N[(N[(N[(x$46$re * y$46$re), $MachinePrecision] + N[(x$46$im * y$46$im), $MachinePrecision]), $MachinePrecision] / N[(N[(y$46$re * y$46$re), $MachinePrecision] + N[(y$46$im * y$46$im), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 82.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x.re \cdot y.re + x.im \cdot y.im}{y.re \cdot y.re + y.im \cdot y.im}\\ t_1 := \frac{\mathsf{fma}\left(x.re, \frac{y.re}{y.im}, x.im\right)}{y.im}\\ \mathbf{if}\;y.im \leq -2.4 \cdot 10^{+151}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y.im \leq -8 \cdot 10^{-147}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y.im \leq 2.6 \cdot 10^{-66}:\\ \;\;\;\;\frac{\mathsf{fma}\left(x.im, \frac{y.im}{y.re}, x.re\right)}{y.re}\\ \mathbf{elif}\;y.im \leq 6 \cdot 10^{+151}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x.re x.im y.re y.im)
 :precision binary64
 (let* ((t_0
         (/ (+ (* x.re y.re) (* x.im y.im)) (+ (* y.re y.re) (* y.im y.im))))
        (t_1 (/ (fma x.re (/ y.re y.im) x.im) y.im)))
   (if (<= y.im -2.4e+151)
     t_1
     (if (<= y.im -8e-147)
       t_0
       (if (<= y.im 2.6e-66)
         (/ (fma x.im (/ y.im y.re) x.re) y.re)
         (if (<= y.im 6e+151) t_0 t_1))))))

C

double code(double x_46_re, double x_46_im, double y_46_re, double y_46_im) {
	double t_0 = ((x_46_re * y_46_re) + (x_46_im * y_46_im)) / ((y_46_re * y_46_re) + (y_46_im * y_46_im));
	double t_1 = fma(x_46_re, (y_46_re / y_46_im), x_46_im) / y_46_im;
	double tmp;
	if (y_46_im <= -2.4e+151) {
		tmp = t_1;
	} else if (y_46_im <= -8e-147) {
		tmp = t_0;
	} else if (y_46_im <= 2.6e-66) {
		tmp = fma(x_46_im, (y_46_im / y_46_re), x_46_re) / y_46_re;
	} else if (y_46_im <= 6e+151) {
		tmp = t_0;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x_46_re, x_46_im, y_46_re, y_46_im)
	t_0 = Float64(Float64(Float64(x_46_re * y_46_re) + Float64(x_46_im * y_46_im)) / Float64(Float64(y_46_re * y_46_re) + Float64(y_46_im * y_46_im)))
	t_1 = Float64(fma(x_46_re, Float64(y_46_re / y_46_im), x_46_im) / y_46_im)
	tmp = 0.0
	if (y_46_im <= -2.4e+151)
		tmp = t_1;
	elseif (y_46_im <= -8e-147)
		tmp = t_0;
	elseif (y_46_im <= 2.6e-66)
		tmp = Float64(fma(x_46_im, Float64(y_46_im / y_46_re), x_46_re) / y_46_re);
	elseif (y_46_im <= 6e+151)
		tmp = t_0;
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x$46$re_, x$46$im_, y$46$re_, y$46$im_] := Block[{t$95$0 = N[(N[(N[(x$46$re * y$46$re), $MachinePrecision] + N[(x$46$im * y$46$im), $MachinePrecision]), $MachinePrecision] / N[(N[(y$46$re * y$46$re), $MachinePrecision] + N[(y$46$im * y$46$im), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x$46$re * N[(y$46$re / y$46$im), $MachinePrecision] + x$46$im), $MachinePrecision] / y$46$im), $MachinePrecision]}, If[LessEqual[y$46$im, -2.4e+151], t$95$1, If[LessEqual[y$46$im, -8e-147], t$95$0, If[LessEqual[y$46$im, 2.6e-66], N[(N[(x$46$im * N[(y$46$im / y$46$re), $MachinePrecision] + x$46$re), $MachinePrecision] / y$46$re), $MachinePrecision], If[LessEqual[y$46$im, 6e+151], t$95$0, t$95$1]]]]]]

Derivation

1. Split input into 3 regimes

2. if y.im < -2.4000000000000001e151 or 5.9999999999999998e151 < y.im

   1. Initial program 24.9%

      \[\frac{x.re \cdot y.re + x.im \cdot y.im}{y.re \cdot y.re + y.im \cdot y.im} \]
   2. Add Preprocessing

   3. Taylor expanded in y.im around inf

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x.im + \frac{x.re \cdot y.re}{y.im}}{\color{blue}{y.im}} \]

      2. +-commutative N/A

         \[\leadsto \frac{\frac{x.re \cdot y.re}{y.im} + x.im}{y.im} \]

      3. associate-/l* N/A

         \[\leadsto \frac{x.re \cdot \frac{y.re}{y.im} + x.im}{y.im} \]

      4. lower-fma.f64 N/A

         \[\leadsto \frac{\mathsf{fma}\left(x.re, \frac{y.re}{y.im}, x.im\right)}{y.im} \]

      5. lower-/.f64 86.5

         \[\leadsto \frac{\mathsf{fma}\left(x.re, \frac{y.re}{y.im}, x.im\right)}{y.im} \]

   5. Applied rewrites 86.5%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x.re, \frac{y.re}{y.im}, x.im\right)}{y.im}} \]

   if -2.4000000000000001e151 < y.im < -7.9999999999999998e-147 or 2.5999999999999999e-66 < y.im < 5.9999999999999998e151

   1. Initial program 73.1%

      \[\frac{x.re \cdot y.re + x.im \cdot y.im}{y.re \cdot y.re + y.im \cdot y.im} \]
   2. Add Preprocessing

   if -7.9999999999999998e-147 < y.im < 2.5999999999999999e-66

   1. Initial program 66.3%

      \[\frac{x.re \cdot y.re + x.im \cdot y.im}{y.re \cdot y.re + y.im \cdot y.im} \]
   2. Add Preprocessing

   3. Taylor expanded in y.re around inf

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x.re + \frac{x.im \cdot y.im}{y.re}}{\color{blue}{y.re}} \]

      2. +-commutative N/A

         \[\leadsto \frac{\frac{x.im \cdot y.im}{y.re} + x.re}{y.re} \]

      3. associate-/l* N/A

         \[\leadsto \frac{x.im \cdot \frac{y.im}{y.re} + x.re}{y.re} \]

      4. lower-fma.f64 N/A

         \[\leadsto \frac{\mathsf{fma}\left(x.im, \frac{y.im}{y.re}, x.re\right)}{y.re} \]

      5. lower-/.f64 91.6

         \[\leadsto \frac{\mathsf{fma}\left(x.im, \frac{y.im}{y.re}, x.re\right)}{y.re} \]

   5. Applied rewrites 91.6%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x.im, \frac{y.im}{y.re}, x.re\right)}{y.re}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 2: 77.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\mathsf{fma}\left(x.im, \frac{y.im}{y.re}, x.re\right)}{y.re}\\ \mathbf{if}\;y.re \leq -2.02 \cdot 10^{-91}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y.re \leq 2.05 \cdot 10^{+20}:\\ \;\;\;\;\frac{\frac{y.re \cdot x.re}{y.im} + x.im}{y.im}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x.re x.im y.re y.im)
 :precision binary64
 (let* ((t_0 (/ (fma x.im (/ y.im y.re) x.re) y.re)))
   (if (<= y.re -2.02e-91)
     t_0
     (if (<= y.re 2.05e+20) (/ (+ (/ (* y.re x.re) y.im) x.im) y.im) t_0))))

C

double code(double x_46_re, double x_46_im, double y_46_re, double y_46_im) {
	double t_0 = fma(x_46_im, (y_46_im / y_46_re), x_46_re) / y_46_re;
	double tmp;
	if (y_46_re <= -2.02e-91) {
		tmp = t_0;
	} else if (y_46_re <= 2.05e+20) {
		tmp = (((y_46_re * x_46_re) / y_46_im) + x_46_im) / y_46_im;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x_46_re, x_46_im, y_46_re, y_46_im)
	t_0 = Float64(fma(x_46_im, Float64(y_46_im / y_46_re), x_46_re) / y_46_re)
	tmp = 0.0
	if (y_46_re <= -2.02e-91)
		tmp = t_0;
	elseif (y_46_re <= 2.05e+20)
		tmp = Float64(Float64(Float64(Float64(y_46_re * x_46_re) / y_46_im) + x_46_im) / y_46_im);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x$46$re_, x$46$im_, y$46$re_, y$46$im_] := Block[{t$95$0 = N[(N[(x$46$im * N[(y$46$im / y$46$re), $MachinePrecision] + x$46$re), $MachinePrecision] / y$46$re), $MachinePrecision]}, If[LessEqual[y$46$re, -2.02e-91], t$95$0, If[LessEqual[y$46$re, 2.05e+20], N[(N[(N[(N[(y$46$re * x$46$re), $MachinePrecision] / y$46$im), $MachinePrecision] + x$46$im), $MachinePrecision] / y$46$im), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y.re < -2.01999999999999997e-91 or 2.05e20 < y.re

   1. Initial program 51.3%

      \[\frac{x.re \cdot y.re + x.im \cdot y.im}{y.re \cdot y.re + y.im \cdot y.im} \]
   2. Add Preprocessing

   3. Taylor expanded in y.re around inf

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x.re + \frac{x.im \cdot y.im}{y.re}}{\color{blue}{y.re}} \]

      2. +-commutative N/A

         \[\leadsto \frac{\frac{x.im \cdot y.im}{y.re} + x.re}{y.re} \]

      3. associate-/l* N/A

         \[\leadsto \frac{x.im \cdot \frac{y.im}{y.re} + x.re}{y.re} \]

      4. lower-fma.f64 N/A

         \[\leadsto \frac{\mathsf{fma}\left(x.im, \frac{y.im}{y.re}, x.re\right)}{y.re} \]

      5. lower-/.f64 74.5

         \[\leadsto \frac{\mathsf{fma}\left(x.im, \frac{y.im}{y.re}, x.re\right)}{y.re} \]

   5. Applied rewrites 74.5%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x.im, \frac{y.im}{y.re}, x.re\right)}{y.re}} \]

   if -2.01999999999999997e-91 < y.re < 2.05e20

   1. Initial program 64.3%

      \[\frac{x.re \cdot y.re + x.im \cdot y.im}{y.re \cdot y.re + y.im \cdot y.im} \]
   2. Add Preprocessing

   3. Taylor expanded in y.im around -inf

      \[\leadsto \color{blue}{-1 \cdot \frac{-1 \cdot x.im + -1 \cdot \frac{x.re \cdot y.re}{y.im}}{y.im}} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(\frac{-1 \cdot x.im + -1 \cdot \frac{x.re \cdot y.re}{y.im}}{y.im}\right) \]

      2. lower-neg.f64 N/A

         \[\leadsto -\frac{-1 \cdot x.im + -1 \cdot \frac{x.re \cdot y.re}{y.im}}{y.im} \]

      3. lower-/.f64 N/A

         \[\leadsto -\frac{-1 \cdot x.im + -1 \cdot \frac{x.re \cdot y.re}{y.im}}{y.im} \]

      4. +-commutative N/A

         \[\leadsto -\frac{-1 \cdot \frac{x.re \cdot y.re}{y.im} + -1 \cdot x.im}{y.im} \]

      5. lower-+.f64 N/A

         \[\leadsto -\frac{-1 \cdot \frac{x.re \cdot y.re}{y.im} + -1 \cdot x.im}{y.im} \]

      6. mul-1-neg N/A

         \[\leadsto -\frac{\left(\mathsf{neg}\left(\frac{x.re \cdot y.re}{y.im}\right)\right) + -1 \cdot x.im}{y.im} \]

      7. lower-neg.f64 N/A

         \[\leadsto -\frac{\left(-\frac{x.re \cdot y.re}{y.im}\right) + -1 \cdot x.im}{y.im} \]

      8. lower-/.f64 N/A

         \[\leadsto -\frac{\left(-\frac{x.re \cdot y.re}{y.im}\right) + -1 \cdot x.im}{y.im} \]

      9. *-commutative N/A

         \[\leadsto -\frac{\left(-\frac{y.re \cdot x.re}{y.im}\right) + -1 \cdot x.im}{y.im} \]

      10. lower-*.f64 N/A

          \[\leadsto -\frac{\left(-\frac{y.re \cdot x.re}{y.im}\right) + -1 \cdot x.im}{y.im} \]

      11. mul-1-neg N/A

          \[\leadsto -\frac{\left(-\frac{y.re \cdot x.re}{y.im}\right) + \left(\mathsf{neg}\left(x.im\right)\right)}{y.im} \]

      12. lower-neg.f64 81.1

          \[\leadsto -\frac{\left(-\frac{y.re \cdot x.re}{y.im}\right) + \left(-x.im\right)}{y.im} \]

   5. Applied rewrites 81.1%

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

4. Final simplification 77.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y.re \leq -2.02 \cdot 10^{-91}:\\ \;\;\;\;\frac{\mathsf{fma}\left(x.im, \frac{y.im}{y.re}, x.re\right)}{y.re}\\ \mathbf{elif}\;y.re \leq 2.05 \cdot 10^{+20}:\\ \;\;\;\;\frac{\frac{y.re \cdot x.re}{y.im} + x.im}{y.im}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(x.im, \frac{y.im}{y.re}, x.re\right)}{y.re}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 76.2% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\mathsf{fma}\left(x.re, \frac{y.re}{y.im}, x.im\right)}{y.im}\\ \mathbf{if}\;y.im \leq -3.2 \cdot 10^{-9}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y.im \leq 2.2 \cdot 10^{+92}:\\ \;\;\;\;\frac{\mathsf{fma}\left(x.im, \frac{y.im}{y.re}, x.re\right)}{y.re}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x.re x.im y.re y.im)
 :precision binary64
 (let* ((t_0 (/ (fma x.re (/ y.re y.im) x.im) y.im)))
   (if (<= y.im -3.2e-9)
     t_0
     (if (<= y.im 2.2e+92) (/ (fma x.im (/ y.im y.re) x.re) y.re) t_0))))

C

double code(double x_46_re, double x_46_im, double y_46_re, double y_46_im) {
	double t_0 = fma(x_46_re, (y_46_re / y_46_im), x_46_im) / y_46_im;
	double tmp;
	if (y_46_im <= -3.2e-9) {
		tmp = t_0;
	} else if (y_46_im <= 2.2e+92) {
		tmp = fma(x_46_im, (y_46_im / y_46_re), x_46_re) / y_46_re;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x_46_re, x_46_im, y_46_re, y_46_im)
	t_0 = Float64(fma(x_46_re, Float64(y_46_re / y_46_im), x_46_im) / y_46_im)
	tmp = 0.0
	if (y_46_im <= -3.2e-9)
		tmp = t_0;
	elseif (y_46_im <= 2.2e+92)
		tmp = Float64(fma(x_46_im, Float64(y_46_im / y_46_re), x_46_re) / y_46_re);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x$46$re_, x$46$im_, y$46$re_, y$46$im_] := Block[{t$95$0 = N[(N[(x$46$re * N[(y$46$re / y$46$im), $MachinePrecision] + x$46$im), $MachinePrecision] / y$46$im), $MachinePrecision]}, If[LessEqual[y$46$im, -3.2e-9], t$95$0, If[LessEqual[y$46$im, 2.2e+92], N[(N[(x$46$im * N[(y$46$im / y$46$re), $MachinePrecision] + x$46$re), $MachinePrecision] / y$46$re), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y.im < -3.20000000000000012e-9 or 2.19999999999999992e92 < y.im

   1. Initial program 40.9%

      \[\frac{x.re \cdot y.re + x.im \cdot y.im}{y.re \cdot y.re + y.im \cdot y.im} \]
   2. Add Preprocessing

   3. Taylor expanded in y.im around inf

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x.im + \frac{x.re \cdot y.re}{y.im}}{\color{blue}{y.im}} \]

      2. +-commutative N/A

         \[\leadsto \frac{\frac{x.re \cdot y.re}{y.im} + x.im}{y.im} \]

      3. associate-/l* N/A

         \[\leadsto \frac{x.re \cdot \frac{y.re}{y.im} + x.im}{y.im} \]

      4. lower-fma.f64 N/A

         \[\leadsto \frac{\mathsf{fma}\left(x.re, \frac{y.re}{y.im}, x.im\right)}{y.im} \]

      5. lower-/.f64 75.5

         \[\leadsto \frac{\mathsf{fma}\left(x.re, \frac{y.re}{y.im}, x.im\right)}{y.im} \]

   5. Applied rewrites 75.5%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x.re, \frac{y.re}{y.im}, x.im\right)}{y.im}} \]

   if -3.20000000000000012e-9 < y.im < 2.19999999999999992e92

   1. Initial program 70.5%

      \[\frac{x.re \cdot y.re + x.im \cdot y.im}{y.re \cdot y.re + y.im \cdot y.im} \]
   2. Add Preprocessing

   3. Taylor expanded in y.re around inf

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x.re + \frac{x.im \cdot y.im}{y.re}}{\color{blue}{y.re}} \]

      2. +-commutative N/A

         \[\leadsto \frac{\frac{x.im \cdot y.im}{y.re} + x.re}{y.re} \]

      3. associate-/l* N/A

         \[\leadsto \frac{x.im \cdot \frac{y.im}{y.re} + x.re}{y.re} \]

      4. lower-fma.f64 N/A

         \[\leadsto \frac{\mathsf{fma}\left(x.im, \frac{y.im}{y.re}, x.re\right)}{y.re} \]

      5. lower-/.f64 78.7

         \[\leadsto \frac{\mathsf{fma}\left(x.im, \frac{y.im}{y.re}, x.re\right)}{y.re} \]

   5. Applied rewrites 78.7%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x.im, \frac{y.im}{y.re}, x.re\right)}{y.re}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 71.7% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y.im \leq -3.9 \cdot 10^{+123}:\\ \;\;\;\;\frac{x.im}{y.im}\\ \mathbf{elif}\;y.im \leq 2.7 \cdot 10^{+101}:\\ \;\;\;\;\frac{\mathsf{fma}\left(x.im, \frac{y.im}{y.re}, x.re\right)}{y.re}\\ \mathbf{else}:\\ \;\;\;\;\frac{x.im}{y.im}\\ \end{array} \end{array} \]

FPCore

(FPCore (x.re x.im y.re y.im)
 :precision binary64
 (if (<= y.im -3.9e+123)
   (/ x.im y.im)
   (if (<= y.im 2.7e+101)
     (/ (fma x.im (/ y.im y.re) x.re) y.re)
     (/ x.im y.im))))

C

double code(double x_46_re, double x_46_im, double y_46_re, double y_46_im) {
	double tmp;
	if (y_46_im <= -3.9e+123) {
		tmp = x_46_im / y_46_im;
	} else if (y_46_im <= 2.7e+101) {
		tmp = fma(x_46_im, (y_46_im / y_46_re), x_46_re) / y_46_re;
	} else {
		tmp = x_46_im / y_46_im;
	}
	return tmp;
}

Julia

function code(x_46_re, x_46_im, y_46_re, y_46_im)
	tmp = 0.0
	if (y_46_im <= -3.9e+123)
		tmp = Float64(x_46_im / y_46_im);
	elseif (y_46_im <= 2.7e+101)
		tmp = Float64(fma(x_46_im, Float64(y_46_im / y_46_re), x_46_re) / y_46_re);
	else
		tmp = Float64(x_46_im / y_46_im);
	end
	return tmp
end

Wolfram

code[x$46$re_, x$46$im_, y$46$re_, y$46$im_] := If[LessEqual[y$46$im, -3.9e+123], N[(x$46$im / y$46$im), $MachinePrecision], If[LessEqual[y$46$im, 2.7e+101], N[(N[(x$46$im * N[(y$46$im / y$46$re), $MachinePrecision] + x$46$re), $MachinePrecision] / y$46$re), $MachinePrecision], N[(x$46$im / y$46$im), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y.im < -3.89999999999999993e123 or 2.70000000000000006e101 < y.im

   1. Initial program 33.5%

      \[\frac{x.re \cdot y.re + x.im \cdot y.im}{y.re \cdot y.re + y.im \cdot y.im} \]
   2. Add Preprocessing

   3. Taylor expanded in y.re around 0

      \[\leadsto \color{blue}{\frac{x.im}{y.im}} \]
   4. Step-by-step derivation

      1. lower-/.f64 75.5

         \[\leadsto \frac{x.im}{\color{blue}{y.im}} \]

   5. Applied rewrites 75.5%

      \[\leadsto \color{blue}{\frac{x.im}{y.im}} \]

   if -3.89999999999999993e123 < y.im < 2.70000000000000006e101

   1. Initial program 70.2%

      \[\frac{x.re \cdot y.re + x.im \cdot y.im}{y.re \cdot y.re + y.im \cdot y.im} \]
   2. Add Preprocessing

   3. Taylor expanded in y.re around inf

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x.re + \frac{x.im \cdot y.im}{y.re}}{\color{blue}{y.re}} \]

      2. +-commutative N/A

         \[\leadsto \frac{\frac{x.im \cdot y.im}{y.re} + x.re}{y.re} \]

      3. associate-/l* N/A

         \[\leadsto \frac{x.im \cdot \frac{y.im}{y.re} + x.re}{y.re} \]

      4. lower-fma.f64 N/A

         \[\leadsto \frac{\mathsf{fma}\left(x.im, \frac{y.im}{y.re}, x.re\right)}{y.re} \]

      5. lower-/.f64 74.3

         \[\leadsto \frac{\mathsf{fma}\left(x.im, \frac{y.im}{y.re}, x.re\right)}{y.re} \]

   5. Applied rewrites 74.3%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x.im, \frac{y.im}{y.re}, x.re\right)}{y.re}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 63.1% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y.im \leq -8.2 \cdot 10^{-18}:\\ \;\;\;\;\frac{x.im}{y.im}\\ \mathbf{elif}\;y.im \leq 2.2 \cdot 10^{+92}:\\ \;\;\;\;\frac{x.re}{y.re}\\ \mathbf{else}:\\ \;\;\;\;\frac{x.im}{y.im}\\ \end{array} \end{array} \]

FPCore

(FPCore (x.re x.im y.re y.im)
 :precision binary64
 (if (<= y.im -8.2e-18)
   (/ x.im y.im)
   (if (<= y.im 2.2e+92) (/ x.re y.re) (/ x.im y.im))))

C

double code(double x_46_re, double x_46_im, double y_46_re, double y_46_im) {
	double tmp;
	if (y_46_im <= -8.2e-18) {
		tmp = x_46_im / y_46_im;
	} else if (y_46_im <= 2.2e+92) {
		tmp = x_46_re / y_46_re;
	} else {
		tmp = x_46_im / y_46_im;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x_46re, x_46im, y_46re, y_46im)
use fmin_fmax_functions
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im
    real(8), intent (in) :: y_46re
    real(8), intent (in) :: y_46im
    real(8) :: tmp
    if (y_46im <= (-8.2d-18)) then
        tmp = x_46im / y_46im
    else if (y_46im <= 2.2d+92) then
        tmp = x_46re / y_46re
    else
        tmp = x_46im / y_46im
    end if
    code = tmp
end function

Java

public static double code(double x_46_re, double x_46_im, double y_46_re, double y_46_im) {
	double tmp;
	if (y_46_im <= -8.2e-18) {
		tmp = x_46_im / y_46_im;
	} else if (y_46_im <= 2.2e+92) {
		tmp = x_46_re / y_46_re;
	} else {
		tmp = x_46_im / y_46_im;
	}
	return tmp;
}

Python

def code(x_46_re, x_46_im, y_46_re, y_46_im):
	tmp = 0
	if y_46_im <= -8.2e-18:
		tmp = x_46_im / y_46_im
	elif y_46_im <= 2.2e+92:
		tmp = x_46_re / y_46_re
	else:
		tmp = x_46_im / y_46_im
	return tmp

Julia

function code(x_46_re, x_46_im, y_46_re, y_46_im)
	tmp = 0.0
	if (y_46_im <= -8.2e-18)
		tmp = Float64(x_46_im / y_46_im);
	elseif (y_46_im <= 2.2e+92)
		tmp = Float64(x_46_re / y_46_re);
	else
		tmp = Float64(x_46_im / y_46_im);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x_46_re, x_46_im, y_46_re, y_46_im)
	tmp = 0.0;
	if (y_46_im <= -8.2e-18)
		tmp = x_46_im / y_46_im;
	elseif (y_46_im <= 2.2e+92)
		tmp = x_46_re / y_46_re;
	else
		tmp = x_46_im / y_46_im;
	end
	tmp_2 = tmp;
end

Wolfram

code[x$46$re_, x$46$im_, y$46$re_, y$46$im_] := If[LessEqual[y$46$im, -8.2e-18], N[(x$46$im / y$46$im), $MachinePrecision], If[LessEqual[y$46$im, 2.2e+92], N[(x$46$re / y$46$re), $MachinePrecision], N[(x$46$im / y$46$im), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y.im < -8.1999999999999995e-18 or 2.19999999999999992e92 < y.im

   1. Initial program 41.8%

      \[\frac{x.re \cdot y.re + x.im \cdot y.im}{y.re \cdot y.re + y.im \cdot y.im} \]
   2. Add Preprocessing

   3. Taylor expanded in y.re around 0

      \[\leadsto \color{blue}{\frac{x.im}{y.im}} \]
   4. Step-by-step derivation

      1. lower-/.f64 67.4

         \[\leadsto \frac{x.im}{\color{blue}{y.im}} \]

   5. Applied rewrites 67.4%

      \[\leadsto \color{blue}{\frac{x.im}{y.im}} \]

   if -8.1999999999999995e-18 < y.im < 2.19999999999999992e92

   1. Initial program 70.1%

      \[\frac{x.re \cdot y.re + x.im \cdot y.im}{y.re \cdot y.re + y.im \cdot y.im} \]
   2. Add Preprocessing

   3. Taylor expanded in y.re around inf

      \[\leadsto \color{blue}{\frac{x.re}{y.re}} \]
   4. Step-by-step derivation

      1. lower-/.f64 65.5

         \[\leadsto \frac{x.re}{\color{blue}{y.re}} \]

   5. Applied rewrites 65.5%

      \[\leadsto \color{blue}{\frac{x.re}{y.re}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 43.1% accurate, 5.0× speedup

Math

\[\begin{array}{l} \\ \frac{x.im}{y.im} \end{array} \]

FPCore

(FPCore (x.re x.im y.re y.im) :precision binary64 (/ x.im y.im))

C

double code(double x_46_re, double x_46_im, double y_46_re, double y_46_im) {
	return x_46_im / y_46_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(x_46re, x_46im, y_46re, y_46im)
use fmin_fmax_functions
    real(8), intent (in) :: x_46re
    real(8), intent (in) :: x_46im
    real(8), intent (in) :: y_46re
    real(8), intent (in) :: y_46im
    code = x_46im / y_46im
end function

Java

public static double code(double x_46_re, double x_46_im, double y_46_re, double y_46_im) {
	return x_46_im / y_46_im;
}

Python

def code(x_46_re, x_46_im, y_46_re, y_46_im):
	return x_46_im / y_46_im

Julia

function code(x_46_re, x_46_im, y_46_re, y_46_im)
	return Float64(x_46_im / y_46_im)
end

MATLAB

function tmp = code(x_46_re, x_46_im, y_46_re, y_46_im)
	tmp = x_46_im / y_46_im;
end

Wolfram

code[x$46$re_, x$46$im_, y$46$re_, y$46$im_] := N[(x$46$im / y$46$im), $MachinePrecision]

Derivation

1. Initial program 56.7%

   \[\frac{x.re \cdot y.re + x.im \cdot y.im}{y.re \cdot y.re + y.im \cdot y.im} \]
2. Add Preprocessing

3. Taylor expanded in y.re around 0

   \[\leadsto \color{blue}{\frac{x.im}{y.im}} \]
4. Step-by-step derivation

   1. lower-/.f64 39.9

      \[\leadsto \frac{x.im}{\color{blue}{y.im}} \]

5. Applied rewrites 39.9%

   \[\leadsto \color{blue}{\frac{x.im}{y.im}} \]
6. Add Preprocessing

Reproduce

herbie shell --seed 2025064 
(FPCore (x.re x.im y.re y.im)
  :name "_divideComplex, real part"
  :precision binary64
  (/ (+ (* x.re y.re) (* x.im y.im)) (+ (* y.re y.re) (* y.im y.im))))