_divideComplex, imaginary part

Percentage Accurate: 61.8% → 80.8%

Time: 6.4s

Alternatives: 7

Speedup: 1.5×

Specification

Math

\[\begin{array}{l} \\ \frac{x.im \cdot y.re - x.re \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.im y.re) (* x.re 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_im * y_46_re) - (x_46_re * 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_46im * y_46re) - (x_46re * 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_im * y_46_re) - (x_46_re * 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_im * y_46_re) - (x_46_re * 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_im * y_46_re) - Float64(x_46_re * 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_im * y_46_re) - (x_46_re * 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$im * y$46$re), $MachinePrecision] - N[(x$46$re * 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.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x.im \cdot y.re - x.re \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.im y.re) (* x.re 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_im * y_46_re) - (x_46_re * 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_46im * y_46re) - (x_46re * 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_im * y_46_re) - (x_46_re * 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_im * y_46_re) - (x_46_re * 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_im * y_46_re) - Float64(x_46_re * 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_im * y_46_re) - (x_46_re * 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$im * y$46$re), $MachinePrecision] - N[(x$46$re * 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: 80.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x.im - y.im \cdot \frac{x.re}{y.re}}{y.re}\\ \mathbf{if}\;y.re \leq -8.2 \cdot 10^{+116}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y.re \leq -5.6 \cdot 10^{-99}:\\ \;\;\;\;\frac{x.im \cdot y.re - x.re \cdot y.im}{y.re \cdot y.re + y.im \cdot y.im}\\ \mathbf{elif}\;y.re \leq 4.4 \cdot 10^{-26}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{y.re}{y.im}, x.im, -x.re\right)}{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 (/ (- x.im (* y.im (/ x.re y.re))) y.re)))
   (if (<= y.re -8.2e+116)
     t_0
     (if (<= y.re -5.6e-99)
       (/ (- (* x.im y.re) (* x.re y.im)) (+ (* y.re y.re) (* y.im y.im)))
       (if (<= y.re 4.4e-26)
         (/ (fma (/ y.re y.im) x.im (- x.re)) 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 = (x_46_im - (y_46_im * (x_46_re / y_46_re))) / y_46_re;
	double tmp;
	if (y_46_re <= -8.2e+116) {
		tmp = t_0;
	} else if (y_46_re <= -5.6e-99) {
		tmp = ((x_46_im * y_46_re) - (x_46_re * y_46_im)) / ((y_46_re * y_46_re) + (y_46_im * y_46_im));
	} else if (y_46_re <= 4.4e-26) {
		tmp = fma((y_46_re / y_46_im), x_46_im, -x_46_re) / 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(Float64(x_46_im - Float64(y_46_im * Float64(x_46_re / y_46_re))) / y_46_re)
	tmp = 0.0
	if (y_46_re <= -8.2e+116)
		tmp = t_0;
	elseif (y_46_re <= -5.6e-99)
		tmp = Float64(Float64(Float64(x_46_im * y_46_re) - Float64(x_46_re * y_46_im)) / Float64(Float64(y_46_re * y_46_re) + Float64(y_46_im * y_46_im)));
	elseif (y_46_re <= 4.4e-26)
		tmp = Float64(fma(Float64(y_46_re / y_46_im), x_46_im, Float64(-x_46_re)) / 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 * N[(x$46$re / y$46$re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / y$46$re), $MachinePrecision]}, If[LessEqual[y$46$re, -8.2e+116], t$95$0, If[LessEqual[y$46$re, -5.6e-99], N[(N[(N[(x$46$im * y$46$re), $MachinePrecision] - N[(x$46$re * y$46$im), $MachinePrecision]), $MachinePrecision] / N[(N[(y$46$re * y$46$re), $MachinePrecision] + N[(y$46$im * y$46$im), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y$46$re, 4.4e-26], N[(N[(N[(y$46$re / y$46$im), $MachinePrecision] * x$46$im + (-x$46$re)), $MachinePrecision] / y$46$im), $MachinePrecision], t$95$0]]]]

Derivation

1. Split input into 3 regimes

2. if y.re < -8.1999999999999996e116 or 4.4000000000000002e-26 < y.re

   1. Initial program 47.0%

      \[\frac{x.im \cdot y.re - x.re \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.im + -1 \cdot \frac{x.re \cdot y.im}{y.re}}{y.re}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. fp-cancel-sign-sub-inv N/A

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

      3. metadata-eval N/A

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

      4. *-lft-identity N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-*.f64 83.7

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

   5. Applied rewrites 83.7%

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

   7. Applied rewrites 87.1%

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

   if -8.1999999999999996e116 < y.re < -5.6000000000000001e-99

   1. Initial program 83.7%

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

   if -5.6000000000000001e-99 < y.re < 4.4000000000000002e-26

   1. Initial program 62.7%

      \[\frac{x.im \cdot y.re - x.re \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}{-1 \cdot \frac{x.re}{y.im} + \frac{x.im \cdot y.re}{{y.im}^{2}}} \]
   4. Step-by-step derivation

      1. associate-*r/ N/A

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

      2. unpow2 N/A

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

      3. associate-/r* N/A

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

      4. div-add N/A

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

      5. +-commutative N/A

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

      6. fp-cancel-sign-sub-inv N/A

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

      7. metadata-eval N/A

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

      8. *-lft-identity N/A

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

      9. lower-/.f64 N/A

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

      10. *-lft-identity N/A

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

      11. fp-cancel-sub-sign-inv N/A

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

      12. associate-/l* N/A

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

      13. *-commutative N/A

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

      14. metadata-eval N/A

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

      15. lower-fma.f64 N/A

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

      16. lower-/.f64 N/A

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

      17. mul-1-neg N/A

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

      18. lower-neg.f64 87.6

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

   5. Applied rewrites 87.6%

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

Alternative 2: 66.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x.im \cdot y.re - x.re \cdot y.im}{y.re \cdot y.re}\\ \mathbf{if}\;y.re \leq -4.7 \cdot 10^{+117}:\\ \;\;\;\;\frac{x.im}{y.re}\\ \mathbf{elif}\;y.re \leq -2.35 \cdot 10^{-17}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y.re \leq 5.2 \cdot 10^{-27}:\\ \;\;\;\;\frac{-x.re}{y.im}\\ \mathbf{elif}\;y.re \leq 6.4 \cdot 10^{+85}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\frac{x.im}{y.re}\\ \end{array} \end{array} \]

FPCore

(FPCore (x.re x.im y.re y.im)
 :precision binary64
 (let* ((t_0 (/ (- (* x.im y.re) (* x.re y.im)) (* y.re y.re))))
   (if (<= y.re -4.7e+117)
     (/ x.im y.re)
     (if (<= y.re -2.35e-17)
       t_0
       (if (<= y.re 5.2e-27)
         (/ (- x.re) y.im)
         (if (<= y.re 6.4e+85) t_0 (/ x.im y.re)))))))

C

double code(double x_46_re, double x_46_im, double y_46_re, double y_46_im) {
	double t_0 = ((x_46_im * y_46_re) - (x_46_re * y_46_im)) / (y_46_re * y_46_re);
	double tmp;
	if (y_46_re <= -4.7e+117) {
		tmp = x_46_im / y_46_re;
	} else if (y_46_re <= -2.35e-17) {
		tmp = t_0;
	} else if (y_46_re <= 5.2e-27) {
		tmp = -x_46_re / y_46_im;
	} else if (y_46_re <= 6.4e+85) {
		tmp = t_0;
	} else {
		tmp = x_46_im / y_46_re;
	}
	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) :: t_0
    real(8) :: tmp
    t_0 = ((x_46im * y_46re) - (x_46re * y_46im)) / (y_46re * y_46re)
    if (y_46re <= (-4.7d+117)) then
        tmp = x_46im / y_46re
    else if (y_46re <= (-2.35d-17)) then
        tmp = t_0
    else if (y_46re <= 5.2d-27) then
        tmp = -x_46re / y_46im
    else if (y_46re <= 6.4d+85) then
        tmp = t_0
    else
        tmp = x_46im / y_46re
    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 t_0 = ((x_46_im * y_46_re) - (x_46_re * y_46_im)) / (y_46_re * y_46_re);
	double tmp;
	if (y_46_re <= -4.7e+117) {
		tmp = x_46_im / y_46_re;
	} else if (y_46_re <= -2.35e-17) {
		tmp = t_0;
	} else if (y_46_re <= 5.2e-27) {
		tmp = -x_46_re / y_46_im;
	} else if (y_46_re <= 6.4e+85) {
		tmp = t_0;
	} else {
		tmp = x_46_im / y_46_re;
	}
	return tmp;
}

Python

def code(x_46_re, x_46_im, y_46_re, y_46_im):
	t_0 = ((x_46_im * y_46_re) - (x_46_re * y_46_im)) / (y_46_re * y_46_re)
	tmp = 0
	if y_46_re <= -4.7e+117:
		tmp = x_46_im / y_46_re
	elif y_46_re <= -2.35e-17:
		tmp = t_0
	elif y_46_re <= 5.2e-27:
		tmp = -x_46_re / y_46_im
	elif y_46_re <= 6.4e+85:
		tmp = t_0
	else:
		tmp = x_46_im / y_46_re
	return tmp

Julia

function code(x_46_re, x_46_im, y_46_re, y_46_im)
	t_0 = Float64(Float64(Float64(x_46_im * y_46_re) - Float64(x_46_re * y_46_im)) / Float64(y_46_re * y_46_re))
	tmp = 0.0
	if (y_46_re <= -4.7e+117)
		tmp = Float64(x_46_im / y_46_re);
	elseif (y_46_re <= -2.35e-17)
		tmp = t_0;
	elseif (y_46_re <= 5.2e-27)
		tmp = Float64(Float64(-x_46_re) / y_46_im);
	elseif (y_46_re <= 6.4e+85)
		tmp = t_0;
	else
		tmp = Float64(x_46_im / y_46_re);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x_46_re, x_46_im, y_46_re, y_46_im)
	t_0 = ((x_46_im * y_46_re) - (x_46_re * y_46_im)) / (y_46_re * y_46_re);
	tmp = 0.0;
	if (y_46_re <= -4.7e+117)
		tmp = x_46_im / y_46_re;
	elseif (y_46_re <= -2.35e-17)
		tmp = t_0;
	elseif (y_46_re <= 5.2e-27)
		tmp = -x_46_re / y_46_im;
	elseif (y_46_re <= 6.4e+85)
		tmp = t_0;
	else
		tmp = x_46_im / y_46_re;
	end
	tmp_2 = 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$im * y$46$re), $MachinePrecision] - N[(x$46$re * y$46$im), $MachinePrecision]), $MachinePrecision] / N[(y$46$re * y$46$re), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y$46$re, -4.7e+117], N[(x$46$im / y$46$re), $MachinePrecision], If[LessEqual[y$46$re, -2.35e-17], t$95$0, If[LessEqual[y$46$re, 5.2e-27], N[((-x$46$re) / y$46$im), $MachinePrecision], If[LessEqual[y$46$re, 6.4e+85], t$95$0, N[(x$46$im / y$46$re), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if y.re < -4.70000000000000006e117 or 6.40000000000000037e85 < y.re

   1. Initial program 38.7%

      \[\frac{x.im \cdot y.re - x.re \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.im}{y.re}} \]
   4. Step-by-step derivation

      1. lower-/.f64 75.3

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

   5. Applied rewrites 75.3%

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

   if -4.70000000000000006e117 < y.re < -2.35e-17 or 5.20000000000000034e-27 < y.re < 6.40000000000000037e85

   1. Initial program 88.4%

      \[\frac{x.im \cdot y.re - x.re \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 \frac{x.im \cdot y.re - x.re \cdot y.im}{\color{blue}{{y.re}^{2}}} \]
   4. Step-by-step derivation

      1. unpow2 N/A

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

      2. lower-*.f64 68.6

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

   5. Applied rewrites 68.6%

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

   if -2.35e-17 < y.re < 5.20000000000000034e-27

   1. Initial program 63.9%

      \[\frac{x.im \cdot y.re - x.re \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}{-1 \cdot \frac{x.re}{y.im}} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. mul-1-neg N/A

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

      4. lower-/.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 68.7

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

   5. Applied rewrites 68.7%

      \[\leadsto \color{blue}{\frac{x.re}{-y.im}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 71.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y.re \leq -4.7 \cdot 10^{+117}:\\ \;\;\;\;\frac{x.im}{y.re}\\ \mathbf{elif}\;y.re \leq -2.35 \cdot 10^{-17}:\\ \;\;\;\;\frac{x.im \cdot y.re - x.re \cdot y.im}{y.re \cdot y.re}\\ \mathbf{elif}\;y.re \leq 5.2 \cdot 10^{-27}:\\ \;\;\;\;\frac{-x.re}{y.im}\\ \mathbf{elif}\;y.re \leq 6.4 \cdot 10^{+85}:\\ \;\;\;\;\frac{x.im \cdot y.re - x.re \cdot y.im}{y.re \cdot y.re}\\ \mathbf{else}:\\ \;\;\;\;\frac{x.im}{y.re}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 78.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y.re \leq -3.4 \cdot 10^{+50} \lor \neg \left(y.re \leq 4.4 \cdot 10^{-26}\right):\\ \;\;\;\;\frac{x.im - y.im \cdot \frac{x.re}{y.re}}{y.re}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{y.re}{y.im}, x.im, -x.re\right)}{y.im}\\ \end{array} \end{array} \]

FPCore

(FPCore (x.re x.im y.re y.im)
 :precision binary64
 (if (or (<= y.re -3.4e+50) (not (<= y.re 4.4e-26)))
   (/ (- x.im (* y.im (/ x.re y.re))) y.re)
   (/ (fma (/ y.re y.im) x.im (- x.re)) 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_re <= -3.4e+50) || !(y_46_re <= 4.4e-26)) {
		tmp = (x_46_im - (y_46_im * (x_46_re / y_46_re))) / y_46_re;
	} else {
		tmp = fma((y_46_re / y_46_im), x_46_im, -x_46_re) / 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_re <= -3.4e+50) || !(y_46_re <= 4.4e-26))
		tmp = Float64(Float64(x_46_im - Float64(y_46_im * Float64(x_46_re / y_46_re))) / y_46_re);
	else
		tmp = Float64(fma(Float64(y_46_re / y_46_im), x_46_im, Float64(-x_46_re)) / y_46_im);
	end
	return tmp
end

Wolfram

code[x$46$re_, x$46$im_, y$46$re_, y$46$im_] := If[Or[LessEqual[y$46$re, -3.4e+50], N[Not[LessEqual[y$46$re, 4.4e-26]], $MachinePrecision]], N[(N[(x$46$im - N[(y$46$im * N[(x$46$re / y$46$re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / y$46$re), $MachinePrecision], N[(N[(N[(y$46$re / y$46$im), $MachinePrecision] * x$46$im + (-x$46$re)), $MachinePrecision] / y$46$im), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y.re < -3.3999999999999998e50 or 4.4000000000000002e-26 < y.re

   1. Initial program 50.0%

      \[\frac{x.im \cdot y.re - x.re \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.im + -1 \cdot \frac{x.re \cdot y.im}{y.re}}{y.re}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. fp-cancel-sign-sub-inv N/A

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

      3. metadata-eval N/A

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

      4. *-lft-identity N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-*.f64 83.5

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

   5. Applied rewrites 83.5%

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

   7. Applied rewrites 86.6%

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

   if -3.3999999999999998e50 < y.re < 4.4000000000000002e-26

   1. Initial program 66.8%

      \[\frac{x.im \cdot y.re - x.re \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}{-1 \cdot \frac{x.re}{y.im} + \frac{x.im \cdot y.re}{{y.im}^{2}}} \]
   4. Step-by-step derivation

      1. associate-*r/ N/A

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

      2. unpow2 N/A

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

      3. associate-/r* N/A

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

      4. div-add N/A

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

      5. +-commutative N/A

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

      6. fp-cancel-sign-sub-inv N/A

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

      7. metadata-eval N/A

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

      8. *-lft-identity N/A

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

      9. lower-/.f64 N/A

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

      10. *-lft-identity N/A

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

      11. fp-cancel-sub-sign-inv N/A

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

      12. associate-/l* N/A

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

      13. *-commutative N/A

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

      14. metadata-eval N/A

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

      15. lower-fma.f64 N/A

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

      16. lower-/.f64 N/A

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

      17. mul-1-neg N/A

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

      18. lower-neg.f64 81.0

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

   5. Applied rewrites 81.0%

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

4. Final simplification 83.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y.re \leq -3.4 \cdot 10^{+50} \lor \neg \left(y.re \leq 4.4 \cdot 10^{-26}\right):\\ \;\;\;\;\frac{x.im - y.im \cdot \frac{x.re}{y.re}}{y.re}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{y.re}{y.im}, x.im, -x.re\right)}{y.im}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 77.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y.re \leq -3.4 \cdot 10^{+50} \lor \neg \left(y.re \leq 4.4 \cdot 10^{-26}\right):\\ \;\;\;\;\frac{x.im - y.im \cdot \frac{x.re}{y.re}}{y.re}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(y.re, \frac{x.im}{y.im}, -x.re\right)}{y.im}\\ \end{array} \end{array} \]

FPCore

(FPCore (x.re x.im y.re y.im)
 :precision binary64
 (if (or (<= y.re -3.4e+50) (not (<= y.re 4.4e-26)))
   (/ (- x.im (* y.im (/ x.re y.re))) y.re)
   (/ (fma y.re (/ x.im y.im) (- x.re)) 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_re <= -3.4e+50) || !(y_46_re <= 4.4e-26)) {
		tmp = (x_46_im - (y_46_im * (x_46_re / y_46_re))) / y_46_re;
	} else {
		tmp = fma(y_46_re, (x_46_im / y_46_im), -x_46_re) / 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_re <= -3.4e+50) || !(y_46_re <= 4.4e-26))
		tmp = Float64(Float64(x_46_im - Float64(y_46_im * Float64(x_46_re / y_46_re))) / y_46_re);
	else
		tmp = Float64(fma(y_46_re, Float64(x_46_im / y_46_im), Float64(-x_46_re)) / y_46_im);
	end
	return tmp
end

Wolfram

code[x$46$re_, x$46$im_, y$46$re_, y$46$im_] := If[Or[LessEqual[y$46$re, -3.4e+50], N[Not[LessEqual[y$46$re, 4.4e-26]], $MachinePrecision]], N[(N[(x$46$im - N[(y$46$im * N[(x$46$re / y$46$re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / y$46$re), $MachinePrecision], N[(N[(y$46$re * N[(x$46$im / y$46$im), $MachinePrecision] + (-x$46$re)), $MachinePrecision] / y$46$im), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y.re < -3.3999999999999998e50 or 4.4000000000000002e-26 < y.re

   1. Initial program 50.0%

      \[\frac{x.im \cdot y.re - x.re \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.im + -1 \cdot \frac{x.re \cdot y.im}{y.re}}{y.re}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. fp-cancel-sign-sub-inv N/A

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

      3. metadata-eval N/A

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

      4. *-lft-identity N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-*.f64 83.5

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

   5. Applied rewrites 83.5%

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

   7. Applied rewrites 86.6%

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

   if -3.3999999999999998e50 < y.re < 4.4000000000000002e-26

   1. Initial program 66.8%

      \[\frac{x.im \cdot y.re - x.re \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}{-1 \cdot \frac{x.re}{y.im} + \frac{x.im \cdot y.re}{{y.im}^{2}}} \]
   4. Step-by-step derivation

      1. associate-*r/ N/A

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

      2. unpow2 N/A

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

      3. associate-/r* N/A

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

      4. div-add N/A

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

      5. +-commutative N/A

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

      6. fp-cancel-sign-sub-inv N/A

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

      7. metadata-eval N/A

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

      8. *-lft-identity N/A

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

      9. lower-/.f64 N/A

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

      10. *-lft-identity N/A

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

      11. fp-cancel-sub-sign-inv N/A

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

      12. associate-/l* N/A

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

      13. *-commutative N/A

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

      14. metadata-eval N/A

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

      15. lower-fma.f64 N/A

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

      16. lower-/.f64 N/A

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

      17. mul-1-neg N/A

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

      18. lower-neg.f64 81.0

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

   5. Applied rewrites 81.0%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\frac{y.re}{y.im}, x.im, -x.re\right)}{y.im}} \]
   6. Step-by-step derivation

   7. Applied rewrites 78.8%

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

4. Final simplification 82.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y.re \leq -3.4 \cdot 10^{+50} \lor \neg \left(y.re \leq 4.4 \cdot 10^{-26}\right):\\ \;\;\;\;\frac{x.im - y.im \cdot \frac{x.re}{y.re}}{y.re}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(y.re, \frac{x.im}{y.im}, -x.re\right)}{y.im}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 70.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y.re \leq -2.35 \cdot 10^{-17} \lor \neg \left(y.re \leq 5.3 \cdot 10^{-27}\right):\\ \;\;\;\;\frac{x.im - y.im \cdot \frac{x.re}{y.re}}{y.re}\\ \mathbf{else}:\\ \;\;\;\;\frac{-x.re}{y.im}\\ \end{array} \end{array} \]

FPCore

(FPCore (x.re x.im y.re y.im)
 :precision binary64
 (if (or (<= y.re -2.35e-17) (not (<= y.re 5.3e-27)))
   (/ (- x.im (* y.im (/ x.re y.re))) y.re)
   (/ (- x.re) 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_re <= -2.35e-17) || !(y_46_re <= 5.3e-27)) {
		tmp = (x_46_im - (y_46_im * (x_46_re / y_46_re))) / y_46_re;
	} else {
		tmp = -x_46_re / 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_46re <= (-2.35d-17)) .or. (.not. (y_46re <= 5.3d-27))) then
        tmp = (x_46im - (y_46im * (x_46re / y_46re))) / y_46re
    else
        tmp = -x_46re / 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_re <= -2.35e-17) || !(y_46_re <= 5.3e-27)) {
		tmp = (x_46_im - (y_46_im * (x_46_re / y_46_re))) / y_46_re;
	} else {
		tmp = -x_46_re / 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_re <= -2.35e-17) or not (y_46_re <= 5.3e-27):
		tmp = (x_46_im - (y_46_im * (x_46_re / y_46_re))) / y_46_re
	else:
		tmp = -x_46_re / 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_re <= -2.35e-17) || !(y_46_re <= 5.3e-27))
		tmp = Float64(Float64(x_46_im - Float64(y_46_im * Float64(x_46_re / y_46_re))) / y_46_re);
	else
		tmp = Float64(Float64(-x_46_re) / 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_re <= -2.35e-17) || ~((y_46_re <= 5.3e-27)))
		tmp = (x_46_im - (y_46_im * (x_46_re / y_46_re))) / y_46_re;
	else
		tmp = -x_46_re / y_46_im;
	end
	tmp_2 = tmp;
end

Wolfram

code[x$46$re_, x$46$im_, y$46$re_, y$46$im_] := If[Or[LessEqual[y$46$re, -2.35e-17], N[Not[LessEqual[y$46$re, 5.3e-27]], $MachinePrecision]], N[(N[(x$46$im - N[(y$46$im * N[(x$46$re / y$46$re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / y$46$re), $MachinePrecision], N[((-x$46$re) / y$46$im), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y.re < -2.35e-17 or 5.30000000000000006e-27 < y.re

   1. Initial program 54.3%

      \[\frac{x.im \cdot y.re - x.re \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.im + -1 \cdot \frac{x.re \cdot y.im}{y.re}}{y.re}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. fp-cancel-sign-sub-inv N/A

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

      3. metadata-eval N/A

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

      4. *-lft-identity N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-*.f64 79.6

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

   5. Applied rewrites 79.6%

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

   7. Applied rewrites 82.3%

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

   if -2.35e-17 < y.re < 5.30000000000000006e-27

   1. Initial program 63.9%

      \[\frac{x.im \cdot y.re - x.re \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}{-1 \cdot \frac{x.re}{y.im}} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. mul-1-neg N/A

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

      4. lower-/.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 68.7

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

   5. Applied rewrites 68.7%

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

4. Final simplification 76.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y.re \leq -2.35 \cdot 10^{-17} \lor \neg \left(y.re \leq 5.3 \cdot 10^{-27}\right):\\ \;\;\;\;\frac{x.im - y.im \cdot \frac{x.re}{y.re}}{y.re}\\ \mathbf{else}:\\ \;\;\;\;\frac{-x.re}{y.im}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 64.3% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y.re \leq -2.05 \cdot 10^{+40} \lor \neg \left(y.re \leq 1.5 \cdot 10^{-19}\right):\\ \;\;\;\;\frac{x.im}{y.re}\\ \mathbf{else}:\\ \;\;\;\;\frac{-x.re}{y.im}\\ \end{array} \end{array} \]

FPCore

(FPCore (x.re x.im y.re y.im)
 :precision binary64
 (if (or (<= y.re -2.05e+40) (not (<= y.re 1.5e-19)))
   (/ x.im y.re)
   (/ (- x.re) 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_re <= -2.05e+40) || !(y_46_re <= 1.5e-19)) {
		tmp = x_46_im / y_46_re;
	} else {
		tmp = -x_46_re / 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_46re <= (-2.05d+40)) .or. (.not. (y_46re <= 1.5d-19))) then
        tmp = x_46im / y_46re
    else
        tmp = -x_46re / 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_re <= -2.05e+40) || !(y_46_re <= 1.5e-19)) {
		tmp = x_46_im / y_46_re;
	} else {
		tmp = -x_46_re / 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_re <= -2.05e+40) or not (y_46_re <= 1.5e-19):
		tmp = x_46_im / y_46_re
	else:
		tmp = -x_46_re / 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_re <= -2.05e+40) || !(y_46_re <= 1.5e-19))
		tmp = Float64(x_46_im / y_46_re);
	else
		tmp = Float64(Float64(-x_46_re) / 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_re <= -2.05e+40) || ~((y_46_re <= 1.5e-19)))
		tmp = x_46_im / y_46_re;
	else
		tmp = -x_46_re / y_46_im;
	end
	tmp_2 = tmp;
end

Wolfram

code[x$46$re_, x$46$im_, y$46$re_, y$46$im_] := If[Or[LessEqual[y$46$re, -2.05e+40], N[Not[LessEqual[y$46$re, 1.5e-19]], $MachinePrecision]], N[(x$46$im / y$46$re), $MachinePrecision], N[((-x$46$re) / y$46$im), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y.re < -2.0500000000000001e40 or 1.49999999999999996e-19 < y.re

   1. Initial program 50.0%

      \[\frac{x.im \cdot y.re - x.re \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.im}{y.re}} \]
   4. Step-by-step derivation

      1. lower-/.f64 70.7

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

   5. Applied rewrites 70.7%

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

   if -2.0500000000000001e40 < y.re < 1.49999999999999996e-19

   1. Initial program 66.8%

      \[\frac{x.im \cdot y.re - x.re \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}{-1 \cdot \frac{x.re}{y.im}} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. mul-1-neg N/A

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

      4. lower-/.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 63.9

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

   5. Applied rewrites 63.9%

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

4. Final simplification 67.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y.re \leq -2.05 \cdot 10^{+40} \lor \neg \left(y.re \leq 1.5 \cdot 10^{-19}\right):\\ \;\;\;\;\frac{x.im}{y.re}\\ \mathbf{else}:\\ \;\;\;\;\frac{-x.re}{y.im}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 42.6% accurate, 3.2× speedup

Math

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

FPCore

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

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_re;
}

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_46re
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_re;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 58.7%

   \[\frac{x.im \cdot y.re - x.re \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.im}{y.re}} \]
4. Step-by-step derivation

   1. lower-/.f64 43.6

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

5. Applied rewrites 43.6%

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

Reproduce

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