Complex division, real part

Percentage Accurate: 62.1% → 82.9%

Time: 3.4s

Alternatives: 6

Speedup: 1.8×

Specification

Math

\[\begin{array}{l} \\ \frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (/ (+ (* a c) (* b d)) (+ (* c c) (* d d))))

C

double code(double a, double b, double c, double d) {
	return ((a * c) + (b * d)) / ((c * c) + (d * d));
}

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(a, b, c, d)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    code = ((a * c) + (b * d)) / ((c * c) + (d * d))
end function

Java

public static double code(double a, double b, double c, double d) {
	return ((a * c) + (b * d)) / ((c * c) + (d * d));
}

Python

def code(a, b, c, d):
	return ((a * c) + (b * d)) / ((c * c) + (d * d))

Julia

function code(a, b, c, d)
	return Float64(Float64(Float64(a * c) + Float64(b * d)) / Float64(Float64(c * c) + Float64(d * d)))
end

MATLAB

function tmp = code(a, b, c, d)
	tmp = ((a * c) + (b * d)) / ((c * c) + (d * d));
end

Wolfram

code[a_, b_, c_, d_] := N[(N[(N[(a * c), $MachinePrecision] + N[(b * d), $MachinePrecision]), $MachinePrecision] / N[(N[(c * c), $MachinePrecision] + N[(d * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 62.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (/ (+ (* a c) (* b d)) (+ (* c c) (* d d))))

C

double code(double a, double b, double c, double d) {
	return ((a * c) + (b * d)) / ((c * c) + (d * d));
}

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(a, b, c, d)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    code = ((a * c) + (b * d)) / ((c * c) + (d * d))
end function

Java

public static double code(double a, double b, double c, double d) {
	return ((a * c) + (b * d)) / ((c * c) + (d * d));
}

Python

def code(a, b, c, d):
	return ((a * c) + (b * d)) / ((c * c) + (d * d))

Julia

function code(a, b, c, d)
	return Float64(Float64(Float64(a * c) + Float64(b * d)) / Float64(Float64(c * c) + Float64(d * d)))
end

MATLAB

function tmp = code(a, b, c, d)
	tmp = ((a * c) + (b * d)) / ((c * c) + (d * d));
end

Wolfram

code[a_, b_, c_, d_] := N[(N[(N[(a * c), $MachinePrecision] + N[(b * d), $MachinePrecision]), $MachinePrecision] / N[(N[(c * c), $MachinePrecision] + N[(d * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 82.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d}\\ t_1 := \frac{\mathsf{fma}\left(a, \frac{c}{d}, b\right)}{d}\\ \mathbf{if}\;d \leq -5.6 \cdot 10^{+58}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;d \leq -4.1 \cdot 10^{-145}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;d \leq 9.5 \cdot 10^{-137}:\\ \;\;\;\;\frac{\mathsf{fma}\left(b, \frac{d}{c}, a\right)}{c}\\ \mathbf{elif}\;d \leq 1.3 \cdot 10^{+141}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (let* ((t_0 (/ (+ (* a c) (* b d)) (+ (* c c) (* d d))))
        (t_1 (/ (fma a (/ c d) b) d)))
   (if (<= d -5.6e+58)
     t_1
     (if (<= d -4.1e-145)
       t_0
       (if (<= d 9.5e-137)
         (/ (fma b (/ d c) a) c)
         (if (<= d 1.3e+141) t_0 t_1))))))

C

double code(double a, double b, double c, double d) {
	double t_0 = ((a * c) + (b * d)) / ((c * c) + (d * d));
	double t_1 = fma(a, (c / d), b) / d;
	double tmp;
	if (d <= -5.6e+58) {
		tmp = t_1;
	} else if (d <= -4.1e-145) {
		tmp = t_0;
	} else if (d <= 9.5e-137) {
		tmp = fma(b, (d / c), a) / c;
	} else if (d <= 1.3e+141) {
		tmp = t_0;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(a, b, c, d)
	t_0 = Float64(Float64(Float64(a * c) + Float64(b * d)) / Float64(Float64(c * c) + Float64(d * d)))
	t_1 = Float64(fma(a, Float64(c / d), b) / d)
	tmp = 0.0
	if (d <= -5.6e+58)
		tmp = t_1;
	elseif (d <= -4.1e-145)
		tmp = t_0;
	elseif (d <= 9.5e-137)
		tmp = Float64(fma(b, Float64(d / c), a) / c);
	elseif (d <= 1.3e+141)
		tmp = t_0;
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[a_, b_, c_, d_] := Block[{t$95$0 = N[(N[(N[(a * c), $MachinePrecision] + N[(b * d), $MachinePrecision]), $MachinePrecision] / N[(N[(c * c), $MachinePrecision] + N[(d * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(a * N[(c / d), $MachinePrecision] + b), $MachinePrecision] / d), $MachinePrecision]}, If[LessEqual[d, -5.6e+58], t$95$1, If[LessEqual[d, -4.1e-145], t$95$0, If[LessEqual[d, 9.5e-137], N[(N[(b * N[(d / c), $MachinePrecision] + a), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[d, 1.3e+141], t$95$0, t$95$1]]]]]]

Derivation

1. Split input into 3 regimes

2. if d < -5.5999999999999996e58 or 1.3e141 < d

   1. Initial program 40.8%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]

   2. Taylor expanded in d around inf

      \[\leadsto \color{blue}{\frac{b + \frac{a \cdot c}{d}}{d}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{b + \frac{a \cdot c}{d}}{\color{blue}{d}} \]

      2. +-commutative N/A

         \[\leadsto \frac{\frac{a \cdot c}{d} + b}{d} \]

      3. associate-/l* N/A

         \[\leadsto \frac{a \cdot \frac{c}{d} + b}{d} \]

      4. lower-fma.f64 N/A

         \[\leadsto \frac{\mathsf{fma}\left(a, \frac{c}{d}, b\right)}{d} \]

      5. lower-/.f64 85.0

         \[\leadsto \frac{\mathsf{fma}\left(a, \frac{c}{d}, b\right)}{d} \]

   4. Applied rewrites 85.0%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(a, \frac{c}{d}, b\right)}{d}} \]

   if -5.5999999999999996e58 < d < -4.0999999999999997e-145 or 9.5000000000000007e-137 < d < 1.3e141

   1. Initial program 75.5%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]

   if -4.0999999999999997e-145 < d < 9.5000000000000007e-137

   1. Initial program 68.9%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]

   2. Taylor expanded in c around inf

      \[\leadsto \color{blue}{\frac{a + \frac{b \cdot d}{c}}{c}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{a + \frac{b \cdot d}{c}}{\color{blue}{c}} \]

      2. +-commutative N/A

         \[\leadsto \frac{\frac{b \cdot d}{c} + a}{c} \]

      3. associate-/l* N/A

         \[\leadsto \frac{b \cdot \frac{d}{c} + a}{c} \]

      4. lower-fma.f64 N/A

         \[\leadsto \frac{\mathsf{fma}\left(b, \frac{d}{c}, a\right)}{c} \]

      5. lower-/.f64 91.0

         \[\leadsto \frac{\mathsf{fma}\left(b, \frac{d}{c}, a\right)}{c} \]

   4. Applied rewrites 91.0%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(b, \frac{d}{c}, a\right)}{c}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 2: 78.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\mathsf{fma}\left(b, \frac{d}{c}, a\right)}{c}\\ \mathbf{if}\;c \leq -9.2 \cdot 10^{-36}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;c \leq 0.00024:\\ \;\;\;\;-\frac{\left(-\frac{c \cdot a}{d}\right) + \left(-b\right)}{d}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (let* ((t_0 (/ (fma b (/ d c) a) c)))
   (if (<= c -9.2e-36)
     t_0
     (if (<= c 0.00024) (- (/ (+ (- (/ (* c a) d)) (- b)) d)) t_0))))

C

double code(double a, double b, double c, double d) {
	double t_0 = fma(b, (d / c), a) / c;
	double tmp;
	if (c <= -9.2e-36) {
		tmp = t_0;
	} else if (c <= 0.00024) {
		tmp = -((-((c * a) / d) + -b) / d);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(a, b, c, d)
	t_0 = Float64(fma(b, Float64(d / c), a) / c)
	tmp = 0.0
	if (c <= -9.2e-36)
		tmp = t_0;
	elseif (c <= 0.00024)
		tmp = Float64(-Float64(Float64(Float64(-Float64(Float64(c * a) / d)) + Float64(-b)) / d));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[a_, b_, c_, d_] := Block[{t$95$0 = N[(N[(b * N[(d / c), $MachinePrecision] + a), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[c, -9.2e-36], t$95$0, If[LessEqual[c, 0.00024], (-N[(N[((-N[(N[(c * a), $MachinePrecision] / d), $MachinePrecision]) + (-b)), $MachinePrecision] / d), $MachinePrecision]), t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if c < -9.19999999999999986e-36 or 2.40000000000000006e-4 < c

   1. Initial program 51.7%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]

   2. Taylor expanded in c around inf

      \[\leadsto \color{blue}{\frac{a + \frac{b \cdot d}{c}}{c}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{a + \frac{b \cdot d}{c}}{\color{blue}{c}} \]

      2. +-commutative N/A

         \[\leadsto \frac{\frac{b \cdot d}{c} + a}{c} \]

      3. associate-/l* N/A

         \[\leadsto \frac{b \cdot \frac{d}{c} + a}{c} \]

      4. lower-fma.f64 N/A

         \[\leadsto \frac{\mathsf{fma}\left(b, \frac{d}{c}, a\right)}{c} \]

      5. lower-/.f64 74.1

         \[\leadsto \frac{\mathsf{fma}\left(b, \frac{d}{c}, a\right)}{c} \]

   4. Applied rewrites 74.1%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(b, \frac{d}{c}, a\right)}{c}} \]

   if -9.19999999999999986e-36 < c < 2.40000000000000006e-4

   1. Initial program 73.9%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]

   2. Taylor expanded in d around -inf

      \[\leadsto \color{blue}{-1 \cdot \frac{-1 \cdot b + -1 \cdot \frac{a \cdot c}{d}}{d}} \]
   3. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(\frac{-1 \cdot b + -1 \cdot \frac{a \cdot c}{d}}{d}\right) \]

      2. lower-neg.f64 N/A

         \[\leadsto -\frac{-1 \cdot b + -1 \cdot \frac{a \cdot c}{d}}{d} \]

      3. lower-/.f64 N/A

         \[\leadsto -\frac{-1 \cdot b + -1 \cdot \frac{a \cdot c}{d}}{d} \]

      4. +-commutative N/A

         \[\leadsto -\frac{-1 \cdot \frac{a \cdot c}{d} + -1 \cdot b}{d} \]

      5. lower-+.f64 N/A

         \[\leadsto -\frac{-1 \cdot \frac{a \cdot c}{d} + -1 \cdot b}{d} \]

      6. mul-1-neg N/A

         \[\leadsto -\frac{\left(\mathsf{neg}\left(\frac{a \cdot c}{d}\right)\right) + -1 \cdot b}{d} \]

      7. lower-neg.f64 N/A

         \[\leadsto -\frac{\left(-\frac{a \cdot c}{d}\right) + -1 \cdot b}{d} \]

      8. lower-/.f64 N/A

         \[\leadsto -\frac{\left(-\frac{a \cdot c}{d}\right) + -1 \cdot b}{d} \]

      9. *-commutative N/A

         \[\leadsto -\frac{\left(-\frac{c \cdot a}{d}\right) + -1 \cdot b}{d} \]

      10. lower-*.f64 N/A

          \[\leadsto -\frac{\left(-\frac{c \cdot a}{d}\right) + -1 \cdot b}{d} \]

      11. mul-1-neg N/A

          \[\leadsto -\frac{\left(-\frac{c \cdot a}{d}\right) + \left(\mathsf{neg}\left(b\right)\right)}{d} \]

      12. lower-neg.f64 82.7

          \[\leadsto -\frac{\left(-\frac{c \cdot a}{d}\right) + \left(-b\right)}{d} \]

   4. Applied rewrites 82.7%

      \[\leadsto \color{blue}{-\frac{\left(-\frac{c \cdot a}{d}\right) + \left(-b\right)}{d}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 78.1% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\mathsf{fma}\left(b, \frac{d}{c}, a\right)}{c}\\ \mathbf{if}\;c \leq -9.2 \cdot 10^{-36}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;c \leq 0.00024:\\ \;\;\;\;\frac{\mathsf{fma}\left(a, \frac{c}{d}, b\right)}{d}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (let* ((t_0 (/ (fma b (/ d c) a) c)))
   (if (<= c -9.2e-36) t_0 (if (<= c 0.00024) (/ (fma a (/ c d) b) d) t_0))))

C

double code(double a, double b, double c, double d) {
	double t_0 = fma(b, (d / c), a) / c;
	double tmp;
	if (c <= -9.2e-36) {
		tmp = t_0;
	} else if (c <= 0.00024) {
		tmp = fma(a, (c / d), b) / d;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(a, b, c, d)
	t_0 = Float64(fma(b, Float64(d / c), a) / c)
	tmp = 0.0
	if (c <= -9.2e-36)
		tmp = t_0;
	elseif (c <= 0.00024)
		tmp = Float64(fma(a, Float64(c / d), b) / d);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[a_, b_, c_, d_] := Block[{t$95$0 = N[(N[(b * N[(d / c), $MachinePrecision] + a), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[c, -9.2e-36], t$95$0, If[LessEqual[c, 0.00024], N[(N[(a * N[(c / d), $MachinePrecision] + b), $MachinePrecision] / d), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if c < -9.19999999999999986e-36 or 2.40000000000000006e-4 < c

   1. Initial program 51.7%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]

   2. Taylor expanded in c around inf

      \[\leadsto \color{blue}{\frac{a + \frac{b \cdot d}{c}}{c}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{a + \frac{b \cdot d}{c}}{\color{blue}{c}} \]

      2. +-commutative N/A

         \[\leadsto \frac{\frac{b \cdot d}{c} + a}{c} \]

      3. associate-/l* N/A

         \[\leadsto \frac{b \cdot \frac{d}{c} + a}{c} \]

      4. lower-fma.f64 N/A

         \[\leadsto \frac{\mathsf{fma}\left(b, \frac{d}{c}, a\right)}{c} \]

      5. lower-/.f64 74.1

         \[\leadsto \frac{\mathsf{fma}\left(b, \frac{d}{c}, a\right)}{c} \]

   4. Applied rewrites 74.1%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(b, \frac{d}{c}, a\right)}{c}} \]

   if -9.19999999999999986e-36 < c < 2.40000000000000006e-4

   1. Initial program 73.9%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]

   2. Taylor expanded in d around inf

      \[\leadsto \color{blue}{\frac{b + \frac{a \cdot c}{d}}{d}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{b + \frac{a \cdot c}{d}}{\color{blue}{d}} \]

      2. +-commutative N/A

         \[\leadsto \frac{\frac{a \cdot c}{d} + b}{d} \]

      3. associate-/l* N/A

         \[\leadsto \frac{a \cdot \frac{c}{d} + b}{d} \]

      4. lower-fma.f64 N/A

         \[\leadsto \frac{\mathsf{fma}\left(a, \frac{c}{d}, b\right)}{d} \]

      5. lower-/.f64 82.8

         \[\leadsto \frac{\mathsf{fma}\left(a, \frac{c}{d}, b\right)}{d} \]

   4. Applied rewrites 82.8%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(a, \frac{c}{d}, b\right)}{d}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 72.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c \leq -1.9 \cdot 10^{-35}:\\ \;\;\;\;\frac{a}{c}\\ \mathbf{elif}\;c \leq 0.00028:\\ \;\;\;\;\frac{\mathsf{fma}\left(a, \frac{c}{d}, b\right)}{d}\\ \mathbf{else}:\\ \;\;\;\;\frac{a}{c}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (<= c -1.9e-35)
   (/ a c)
   (if (<= c 0.00028) (/ (fma a (/ c d) b) d) (/ a c))))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if (c <= -1.9e-35) {
		tmp = a / c;
	} else if (c <= 0.00028) {
		tmp = fma(a, (c / d), b) / d;
	} else {
		tmp = a / c;
	}
	return tmp;
}

Julia

function code(a, b, c, d)
	tmp = 0.0
	if (c <= -1.9e-35)
		tmp = Float64(a / c);
	elseif (c <= 0.00028)
		tmp = Float64(fma(a, Float64(c / d), b) / d);
	else
		tmp = Float64(a / c);
	end
	return tmp
end

Wolfram

code[a_, b_, c_, d_] := If[LessEqual[c, -1.9e-35], N[(a / c), $MachinePrecision], If[LessEqual[c, 0.00028], N[(N[(a * N[(c / d), $MachinePrecision] + b), $MachinePrecision] / d), $MachinePrecision], N[(a / c), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if c < -1.9000000000000001e-35 or 2.7999999999999998e-4 < c

   1. Initial program 51.6%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]

   2. Taylor expanded in c around inf

      \[\leadsto \color{blue}{\frac{a}{c}} \]
   3. Step-by-step derivation

      1. lower-/.f64 62.5

         \[\leadsto \frac{a}{\color{blue}{c}} \]

   4. Applied rewrites 62.5%

      \[\leadsto \color{blue}{\frac{a}{c}} \]

   if -1.9000000000000001e-35 < c < 2.7999999999999998e-4

   1. Initial program 73.9%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]

   2. Taylor expanded in d around inf

      \[\leadsto \color{blue}{\frac{b + \frac{a \cdot c}{d}}{d}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{b + \frac{a \cdot c}{d}}{\color{blue}{d}} \]

      2. +-commutative N/A

         \[\leadsto \frac{\frac{a \cdot c}{d} + b}{d} \]

      3. associate-/l* N/A

         \[\leadsto \frac{a \cdot \frac{c}{d} + b}{d} \]

      4. lower-fma.f64 N/A

         \[\leadsto \frac{\mathsf{fma}\left(a, \frac{c}{d}, b\right)}{d} \]

      5. lower-/.f64 82.8

         \[\leadsto \frac{\mathsf{fma}\left(a, \frac{c}{d}, b\right)}{d} \]

   4. Applied rewrites 82.8%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(a, \frac{c}{d}, b\right)}{d}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 64.0% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c \leq -9.2 \cdot 10^{-36}:\\ \;\;\;\;\frac{a}{c}\\ \mathbf{elif}\;c \leq 0.00022:\\ \;\;\;\;\frac{b}{d}\\ \mathbf{else}:\\ \;\;\;\;\frac{a}{c}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (<= c -9.2e-36) (/ a c) (if (<= c 0.00022) (/ b d) (/ a c))))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if (c <= -9.2e-36) {
		tmp = a / c;
	} else if (c <= 0.00022) {
		tmp = b / d;
	} else {
		tmp = a / c;
	}
	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(a, b, c, d)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    real(8) :: tmp
    if (c <= (-9.2d-36)) then
        tmp = a / c
    else if (c <= 0.00022d0) then
        tmp = b / d
    else
        tmp = a / c
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c, double d) {
	double tmp;
	if (c <= -9.2e-36) {
		tmp = a / c;
	} else if (c <= 0.00022) {
		tmp = b / d;
	} else {
		tmp = a / c;
	}
	return tmp;
}

Python

def code(a, b, c, d):
	tmp = 0
	if c <= -9.2e-36:
		tmp = a / c
	elif c <= 0.00022:
		tmp = b / d
	else:
		tmp = a / c
	return tmp

Julia

function code(a, b, c, d)
	tmp = 0.0
	if (c <= -9.2e-36)
		tmp = Float64(a / c);
	elseif (c <= 0.00022)
		tmp = Float64(b / d);
	else
		tmp = Float64(a / c);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	tmp = 0.0;
	if (c <= -9.2e-36)
		tmp = a / c;
	elseif (c <= 0.00022)
		tmp = b / d;
	else
		tmp = a / c;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := If[LessEqual[c, -9.2e-36], N[(a / c), $MachinePrecision], If[LessEqual[c, 0.00022], N[(b / d), $MachinePrecision], N[(a / c), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if c < -9.19999999999999986e-36 or 2.20000000000000008e-4 < c

   1. Initial program 51.7%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]

   2. Taylor expanded in c around inf

      \[\leadsto \color{blue}{\frac{a}{c}} \]
   3. Step-by-step derivation

      1. lower-/.f64 62.5

         \[\leadsto \frac{a}{\color{blue}{c}} \]

   4. Applied rewrites 62.5%

      \[\leadsto \color{blue}{\frac{a}{c}} \]

   if -9.19999999999999986e-36 < c < 2.20000000000000008e-4

   1. Initial program 73.9%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]

   2. Taylor expanded in c around 0

      \[\leadsto \color{blue}{\frac{b}{d}} \]
   3. Step-by-step derivation

      1. lower-/.f64 65.8

         \[\leadsto \frac{b}{\color{blue}{d}} \]

   4. Applied rewrites 65.8%

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

Alternative 6: 42.0% accurate, 5.0× speedup

Math

\[\begin{array}{l} \\ \frac{a}{c} \end{array} \]

FPCore

(FPCore (a b c d) :precision binary64 (/ a c))

C

double code(double a, double b, double c, double d) {
	return a / c;
}

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(a, b, c, d)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    code = a / c
end function

Java

public static double code(double a, double b, double c, double d) {
	return a / c;
}

Python

def code(a, b, c, d):
	return a / c

Julia

function code(a, b, c, d)
	return Float64(a / c)
end

MATLAB

function tmp = code(a, b, c, d)
	tmp = a / c;
end

Wolfram

code[a_, b_, c_, d_] := N[(a / c), $MachinePrecision]

Derivation

1. Initial program 62.1%

   \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]

2. Taylor expanded in c around inf

   \[\leadsto \color{blue}{\frac{a}{c}} \]
3. Step-by-step derivation

   1. lower-/.f64 42.0

      \[\leadsto \frac{a}{\color{blue}{c}} \]

4. Applied rewrites 42.0%

   \[\leadsto \color{blue}{\frac{a}{c}} \]
5. Add Preprocessing

Developer Target 1: 99.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left|d\right| < \left|c\right|:\\ \;\;\;\;\frac{a + b \cdot \frac{d}{c}}{c + d \cdot \frac{d}{c}}\\ \mathbf{else}:\\ \;\;\;\;\frac{b + a \cdot \frac{c}{d}}{d + c \cdot \frac{c}{d}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (< (fabs d) (fabs c))
   (/ (+ a (* b (/ d c))) (+ c (* d (/ d c))))
   (/ (+ b (* a (/ c d))) (+ d (* c (/ c d))))))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if (fabs(d) < fabs(c)) {
		tmp = (a + (b * (d / c))) / (c + (d * (d / c)));
	} else {
		tmp = (b + (a * (c / d))) / (d + (c * (c / d)));
	}
	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(a, b, c, d)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    real(8) :: tmp
    if (abs(d) < abs(c)) then
        tmp = (a + (b * (d / c))) / (c + (d * (d / c)))
    else
        tmp = (b + (a * (c / d))) / (d + (c * (c / d)))
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c, double d) {
	double tmp;
	if (Math.abs(d) < Math.abs(c)) {
		tmp = (a + (b * (d / c))) / (c + (d * (d / c)));
	} else {
		tmp = (b + (a * (c / d))) / (d + (c * (c / d)));
	}
	return tmp;
}

Python

def code(a, b, c, d):
	tmp = 0
	if math.fabs(d) < math.fabs(c):
		tmp = (a + (b * (d / c))) / (c + (d * (d / c)))
	else:
		tmp = (b + (a * (c / d))) / (d + (c * (c / d)))
	return tmp

Julia

function code(a, b, c, d)
	tmp = 0.0
	if (abs(d) < abs(c))
		tmp = Float64(Float64(a + Float64(b * Float64(d / c))) / Float64(c + Float64(d * Float64(d / c))));
	else
		tmp = Float64(Float64(b + Float64(a * Float64(c / d))) / Float64(d + Float64(c * Float64(c / d))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	tmp = 0.0;
	if (abs(d) < abs(c))
		tmp = (a + (b * (d / c))) / (c + (d * (d / c)));
	else
		tmp = (b + (a * (c / d))) / (d + (c * (c / d)));
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := If[Less[N[Abs[d], $MachinePrecision], N[Abs[c], $MachinePrecision]], N[(N[(a + N[(b * N[(d / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c + N[(d * N[(d / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b + N[(a * N[(c / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(d + N[(c * N[(c / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Reproduce

herbie shell --seed 2025116 
(FPCore (a b c d)
  :name "Complex division, real part"
  :precision binary64

  :alt
  (! :herbie-platform c (if (< (fabs d) (fabs c)) (/ (+ a (* b (/ d c))) (+ c (* d (/ d c)))) (/ (+ b (* a (/ c d))) (+ d (* c (/ c d))))))

  (/ (+ (* a c) (* b d)) (+ (* c c) (* d d))))