Henrywood and Agarwal, Equation (9a)

Percentage Accurate: 81.5% → 86.2%

Time: 11.4s

Alternatives: 15

Speedup: 2.1×

Specification

Math

\[\begin{array}{l} \\ w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \end{array} \]

FPCore

(FPCore (w0 M D h l d)
 :precision binary64
 (* w0 (sqrt (- 1.0 (* (pow (/ (* M D) (* 2.0 d)) 2.0) (/ h l))))))

C

double code(double w0, double M, double D, double h, double l, double d) {
	return w0 * sqrt((1.0 - (pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}

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(w0, m, d, h, l, d_1)
use fmin_fmax_functions
    real(8), intent (in) :: w0
    real(8), intent (in) :: m
    real(8), intent (in) :: d
    real(8), intent (in) :: h
    real(8), intent (in) :: l
    real(8), intent (in) :: d_1
    code = w0 * sqrt((1.0d0 - ((((m * d) / (2.0d0 * d_1)) ** 2.0d0) * (h / l))))
end function

Java

public static double code(double w0, double M, double D, double h, double l, double d) {
	return w0 * Math.sqrt((1.0 - (Math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}

Python

def code(w0, M, D, h, l, d):
	return w0 * math.sqrt((1.0 - (math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))))

Julia

function code(w0, M, D, h, l, d)
	return Float64(w0 * sqrt(Float64(1.0 - Float64((Float64(Float64(M * D) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)))))
end

MATLAB

function tmp = code(w0, M, D, h, l, d)
	tmp = w0 * sqrt((1.0 - ((((M * D) / (2.0 * d)) ^ 2.0) * (h / l))));
end

Wolfram

code[w0_, M_, D_, h_, l_, d_] := N[(w0 * N[Sqrt[N[(1.0 - N[(N[Power[N[(N[(M * D), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Initial Program: 81.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \end{array} \]

FPCore

(FPCore (w0 M D h l d)
 :precision binary64
 (* w0 (sqrt (- 1.0 (* (pow (/ (* M D) (* 2.0 d)) 2.0) (/ h l))))))

C

double code(double w0, double M, double D, double h, double l, double d) {
	return w0 * sqrt((1.0 - (pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}

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(w0, m, d, h, l, d_1)
use fmin_fmax_functions
    real(8), intent (in) :: w0
    real(8), intent (in) :: m
    real(8), intent (in) :: d
    real(8), intent (in) :: h
    real(8), intent (in) :: l
    real(8), intent (in) :: d_1
    code = w0 * sqrt((1.0d0 - ((((m * d) / (2.0d0 * d_1)) ** 2.0d0) * (h / l))))
end function

Java

public static double code(double w0, double M, double D, double h, double l, double d) {
	return w0 * Math.sqrt((1.0 - (Math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}

Python

def code(w0, M, D, h, l, d):
	return w0 * math.sqrt((1.0 - (math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))))

Julia

function code(w0, M, D, h, l, d)
	return Float64(w0 * sqrt(Float64(1.0 - Float64((Float64(Float64(M * D) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)))))
end

MATLAB

function tmp = code(w0, M, D, h, l, d)
	tmp = w0 * sqrt((1.0 - ((((M * D) / (2.0 * d)) ^ 2.0) * (h / l))));
end

Wolfram

code[w0_, M_, D_, h_, l_, d_] := N[(w0 * N[Sqrt[N[(1.0 - N[(N[Power[N[(N[(M * D), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Alternative 1: 86.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ w0\_m = \left|w0\right| \\ w0\_s = \mathsf{copysign}\left(1, w0\right) \\ [w0_m, M_m, D_m, h, l, d] = \mathsf{sort}([w0_m, M_m, D_m, h, l, d])\\ \\ \begin{array}{l} t_0 := w0\_m \cdot \sqrt{1 - {\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}\\ w0\_s \cdot \begin{array}{l} \mathbf{if}\;t\_0 \leq 5 \cdot 10^{+144}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;w0\_m \cdot \sqrt{\mathsf{fma}\left(\left(\left(\left(-0.25 \cdot h\right) \cdot M\_m\right) \cdot \frac{M\_m}{d}\right) \cdot \frac{D\_m}{d}, \frac{D\_m}{\ell}, 1\right)}\\ \end{array} \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
w0\_m = (fabs.f64 w0)
w0\_s = (copysign.f64 #s(literal 1 binary64) w0)
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0_s w0_m M_m D_m h l d)
 :precision binary64
 (let* ((t_0
         (*
          w0_m
          (sqrt (- 1.0 (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)))))))
   (*
    w0_s
    (if (<= t_0 5e+144)
      t_0
      (*
       w0_m
       (sqrt
        (fma
         (* (* (* (* -0.25 h) M_m) (/ M_m d)) (/ D_m d))
         (/ D_m l)
         1.0)))))))

C

D_m = fabs(D);
M_m = fabs(M);
w0\_m = fabs(w0);
w0\_s = copysign(1.0, w0);
assert(w0_m < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0_s, double w0_m, double M_m, double D_m, double h, double l, double d) {
	double t_0 = w0_m * sqrt((1.0 - (pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l))));
	double tmp;
	if (t_0 <= 5e+144) {
		tmp = t_0;
	} else {
		tmp = w0_m * sqrt(fma(((((-0.25 * h) * M_m) * (M_m / d)) * (D_m / d)), (D_m / l), 1.0));
	}
	return w0_s * tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0\_m = abs(w0)
w0\_s = copysign(1.0, w0)
w0_m, M_m, D_m, h, l, d = sort([w0_m, M_m, D_m, h, l, d])
function code(w0_s, w0_m, M_m, D_m, h, l, d)
	t_0 = Float64(w0_m * sqrt(Float64(1.0 - Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)))))
	tmp = 0.0
	if (t_0 <= 5e+144)
		tmp = t_0;
	else
		tmp = Float64(w0_m * sqrt(fma(Float64(Float64(Float64(Float64(-0.25 * h) * M_m) * Float64(M_m / d)) * Float64(D_m / d)), Float64(D_m / l), 1.0)));
	end
	return Float64(w0_s * tmp)
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
w0\_m = N[Abs[w0], $MachinePrecision]
w0\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[w0]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0$95$s_, w0$95$m_, M$95$m_, D$95$m_, h_, l_, d_] := Block[{t$95$0 = N[(w0$95$m * N[Sqrt[N[(1.0 - N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(w0$95$s * If[LessEqual[t$95$0, 5e+144], t$95$0, N[(w0$95$m * N[Sqrt[N[(N[(N[(N[(N[(-0.25 * h), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision] * N[(D$95$m / l), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 w0 (sqrt.f64 (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))))) < 4.9999999999999999e144

   1. Initial program 91.7%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   if 4.9999999999999999e144 < (*.f64 w0 (sqrt.f64 (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)))))

   1. Initial program 55.4%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in h around inf

      \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{1}{h} - \frac{1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)}} \]
   4. Step-by-step derivation

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

         \[\leadsto w0 \cdot \sqrt{h \cdot \color{blue}{\left(\frac{1}{h} + \left(\mathsf{neg}\left(\frac{1}{4}\right)\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)}} \]

      2. metadata-eval N/A

         \[\leadsto w0 \cdot \sqrt{h \cdot \left(\frac{1}{h} + \color{blue}{\frac{-1}{4}} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)} \]

      3. +-commutative N/A

         \[\leadsto w0 \cdot \sqrt{h \cdot \color{blue}{\left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \frac{1}{h}\right)}} \]

      4. distribute-lft-in N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right) + h \cdot \frac{1}{h}}} \]

      5. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}} + h \cdot \frac{1}{h}} \]

      6. rgt-mult-inverse N/A

         \[\leadsto w0 \cdot \sqrt{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \color{blue}{1}} \]

      7. lower-fma.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot \frac{-1}{4}, \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}, 1\right)}} \]

   5. Applied rewrites 56.7%

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\left(M \cdot M\right) \cdot D\right) \cdot D}{\left(d \cdot d\right) \cdot \ell}, 1\right)}} \]
   6. Step-by-step derivation

   7. Applied rewrites 55.2%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \left(\frac{M}{d} \cdot M\right) \cdot \color{blue}{\frac{D \cdot D}{d \cdot \ell}}, 1\right)} \]

   9. Applied rewrites 74.6%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\left(\left(\left(-0.25 \cdot h\right) \cdot M\right) \cdot \frac{M}{d}\right) \cdot \frac{D}{d}, \color{blue}{\frac{D}{\ell}}, 1\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 85.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ w0\_m = \left|w0\right| \\ w0\_s = \mathsf{copysign}\left(1, w0\right) \\ [w0_m, M_m, D_m, h, l, d] = \mathsf{sort}([w0_m, M_m, D_m, h, l, d])\\ \\ w0\_s \cdot \begin{array}{l} \mathbf{if}\;\sqrt{1 - {\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \leq 2:\\ \;\;\;\;w0\_m \cdot 1\\ \mathbf{else}:\\ \;\;\;\;w0\_m \cdot \sqrt{\mathsf{fma}\left(\left(\left(\left(-0.25 \cdot h\right) \cdot M\_m\right) \cdot \frac{M\_m}{d}\right) \cdot \frac{D\_m}{d}, \frac{D\_m}{\ell}, 1\right)}\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
w0\_m = (fabs.f64 w0)
w0\_s = (copysign.f64 #s(literal 1 binary64) w0)
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0_s w0_m M_m D_m h l d)
 :precision binary64
 (*
  w0_s
  (if (<= (sqrt (- 1.0 (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)))) 2.0)
    (* w0_m 1.0)
    (*
     w0_m
     (sqrt
      (fma (* (* (* (* -0.25 h) M_m) (/ M_m d)) (/ D_m d)) (/ D_m l) 1.0))))))

C

D_m = fabs(D);
M_m = fabs(M);
w0\_m = fabs(w0);
w0\_s = copysign(1.0, w0);
assert(w0_m < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0_s, double w0_m, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if (sqrt((1.0 - (pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)))) <= 2.0) {
		tmp = w0_m * 1.0;
	} else {
		tmp = w0_m * sqrt(fma(((((-0.25 * h) * M_m) * (M_m / d)) * (D_m / d)), (D_m / l), 1.0));
	}
	return w0_s * tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0\_m = abs(w0)
w0\_s = copysign(1.0, w0)
w0_m, M_m, D_m, h, l, d = sort([w0_m, M_m, D_m, h, l, d])
function code(w0_s, w0_m, M_m, D_m, h, l, d)
	tmp = 0.0
	if (sqrt(Float64(1.0 - Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)))) <= 2.0)
		tmp = Float64(w0_m * 1.0);
	else
		tmp = Float64(w0_m * sqrt(fma(Float64(Float64(Float64(Float64(-0.25 * h) * M_m) * Float64(M_m / d)) * Float64(D_m / d)), Float64(D_m / l), 1.0)));
	end
	return Float64(w0_s * tmp)
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
w0\_m = N[Abs[w0], $MachinePrecision]
w0\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[w0]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0$95$s_, w0$95$m_, M$95$m_, D$95$m_, h_, l_, d_] := N[(w0$95$s * If[LessEqual[N[Sqrt[N[(1.0 - N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], N[(w0$95$m * 1.0), $MachinePrecision], N[(w0$95$m * N[Sqrt[N[(N[(N[(N[(N[(-0.25 * h), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision] * N[(D$95$m / d), $MachinePrecision]), $MachinePrecision] * N[(D$95$m / l), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (sqrt.f64 (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)))) < 2

   1. Initial program 100.0%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 100.0%

      \[\leadsto w0 \cdot \color{blue}{1} \]

   if 2 < (sqrt.f64 (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))))

   1. Initial program 51.1%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in h around inf

      \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{1}{h} - \frac{1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)}} \]
   4. Step-by-step derivation

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

         \[\leadsto w0 \cdot \sqrt{h \cdot \color{blue}{\left(\frac{1}{h} + \left(\mathsf{neg}\left(\frac{1}{4}\right)\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)}} \]

      2. metadata-eval N/A

         \[\leadsto w0 \cdot \sqrt{h \cdot \left(\frac{1}{h} + \color{blue}{\frac{-1}{4}} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)} \]

      3. +-commutative N/A

         \[\leadsto w0 \cdot \sqrt{h \cdot \color{blue}{\left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \frac{1}{h}\right)}} \]

      4. distribute-lft-in N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right) + h \cdot \frac{1}{h}}} \]

      5. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}} + h \cdot \frac{1}{h}} \]

      6. rgt-mult-inverse N/A

         \[\leadsto w0 \cdot \sqrt{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \color{blue}{1}} \]

      7. lower-fma.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot \frac{-1}{4}, \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}, 1\right)}} \]

   5. Applied rewrites 46.8%

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\left(M \cdot M\right) \cdot D\right) \cdot D}{\left(d \cdot d\right) \cdot \ell}, 1\right)}} \]
   6. Step-by-step derivation

   7. Applied rewrites 46.8%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \left(\frac{M}{d} \cdot M\right) \cdot \color{blue}{\frac{D \cdot D}{d \cdot \ell}}, 1\right)} \]

   9. Applied rewrites 65.3%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\left(\left(\left(-0.25 \cdot h\right) \cdot M\right) \cdot \frac{M}{d}\right) \cdot \frac{D}{d}, \color{blue}{\frac{D}{\ell}}, 1\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 83.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ w0\_m = \left|w0\right| \\ w0\_s = \mathsf{copysign}\left(1, w0\right) \\ [w0_m, M_m, D_m, h, l, d] = \mathsf{sort}([w0_m, M_m, D_m, h, l, d])\\ \\ w0\_s \cdot \begin{array}{l} \mathbf{if}\;\sqrt{1 - {\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \leq 2:\\ \;\;\;\;w0\_m \cdot 1\\ \mathbf{else}:\\ \;\;\;\;w0\_m \cdot \sqrt{\mathsf{fma}\left(\frac{D\_m}{\ell \cdot d} \cdot D\_m, \left(\left(-0.25 \cdot h\right) \cdot M\_m\right) \cdot \frac{M\_m}{d}, 1\right)}\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
w0\_m = (fabs.f64 w0)
w0\_s = (copysign.f64 #s(literal 1 binary64) w0)
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0_s w0_m M_m D_m h l d)
 :precision binary64
 (*
  w0_s
  (if (<= (sqrt (- 1.0 (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)))) 2.0)
    (* w0_m 1.0)
    (*
     w0_m
     (sqrt
      (fma (* (/ D_m (* l d)) D_m) (* (* (* -0.25 h) M_m) (/ M_m d)) 1.0))))))

C

D_m = fabs(D);
M_m = fabs(M);
w0\_m = fabs(w0);
w0\_s = copysign(1.0, w0);
assert(w0_m < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0_s, double w0_m, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if (sqrt((1.0 - (pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)))) <= 2.0) {
		tmp = w0_m * 1.0;
	} else {
		tmp = w0_m * sqrt(fma(((D_m / (l * d)) * D_m), (((-0.25 * h) * M_m) * (M_m / d)), 1.0));
	}
	return w0_s * tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0\_m = abs(w0)
w0\_s = copysign(1.0, w0)
w0_m, M_m, D_m, h, l, d = sort([w0_m, M_m, D_m, h, l, d])
function code(w0_s, w0_m, M_m, D_m, h, l, d)
	tmp = 0.0
	if (sqrt(Float64(1.0 - Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)))) <= 2.0)
		tmp = Float64(w0_m * 1.0);
	else
		tmp = Float64(w0_m * sqrt(fma(Float64(Float64(D_m / Float64(l * d)) * D_m), Float64(Float64(Float64(-0.25 * h) * M_m) * Float64(M_m / d)), 1.0)));
	end
	return Float64(w0_s * tmp)
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
w0\_m = N[Abs[w0], $MachinePrecision]
w0\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[w0]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0$95$s_, w0$95$m_, M$95$m_, D$95$m_, h_, l_, d_] := N[(w0$95$s * If[LessEqual[N[Sqrt[N[(1.0 - N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], N[(w0$95$m * 1.0), $MachinePrecision], N[(w0$95$m * N[Sqrt[N[(N[(N[(D$95$m / N[(l * d), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(N[(N[(-0.25 * h), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (sqrt.f64 (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)))) < 2

   1. Initial program 100.0%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 100.0%

      \[\leadsto w0 \cdot \color{blue}{1} \]

   if 2 < (sqrt.f64 (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))))

   1. Initial program 51.1%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in h around inf

      \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{1}{h} - \frac{1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)}} \]
   4. Step-by-step derivation

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

         \[\leadsto w0 \cdot \sqrt{h \cdot \color{blue}{\left(\frac{1}{h} + \left(\mathsf{neg}\left(\frac{1}{4}\right)\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)}} \]

      2. metadata-eval N/A

         \[\leadsto w0 \cdot \sqrt{h \cdot \left(\frac{1}{h} + \color{blue}{\frac{-1}{4}} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)} \]

      3. +-commutative N/A

         \[\leadsto w0 \cdot \sqrt{h \cdot \color{blue}{\left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \frac{1}{h}\right)}} \]

      4. distribute-lft-in N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right) + h \cdot \frac{1}{h}}} \]

      5. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}} + h \cdot \frac{1}{h}} \]

      6. rgt-mult-inverse N/A

         \[\leadsto w0 \cdot \sqrt{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \color{blue}{1}} \]

      7. lower-fma.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot \frac{-1}{4}, \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}, 1\right)}} \]

   5. Applied rewrites 46.8%

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\left(M \cdot M\right) \cdot D\right) \cdot D}{\left(d \cdot d\right) \cdot \ell}, 1\right)}} \]
   6. Step-by-step derivation

   7. Applied rewrites 46.8%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \left(\frac{M}{d} \cdot M\right) \cdot \color{blue}{\frac{D \cdot D}{d \cdot \ell}}, 1\right)} \]

   9. Applied rewrites 63.3%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\frac{D}{\ell}}{d} \cdot D, \color{blue}{\left(\left(-0.25 \cdot h\right) \cdot M\right) \cdot \frac{M}{d}}, 1\right)} \]
   10. Step-by-step derivation

   11. Applied rewrites 53.2%

       \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{D}{\ell \cdot d} \cdot D, \left(\color{blue}{\left(-0.25 \cdot h\right)} \cdot M\right) \cdot \frac{M}{d}, 1\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 83.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ w0\_m = \left|w0\right| \\ w0\_s = \mathsf{copysign}\left(1, w0\right) \\ [w0_m, M_m, D_m, h, l, d] = \mathsf{sort}([w0_m, M_m, D_m, h, l, d])\\ \\ w0\_s \cdot \begin{array}{l} \mathbf{if}\;\sqrt{1 - {\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \leq 2:\\ \;\;\;\;w0\_m \cdot 1\\ \mathbf{else}:\\ \;\;\;\;w0\_m \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \frac{D\_m \cdot M\_m}{d \cdot d} \cdot \frac{D\_m \cdot M\_m}{\ell}, 1\right)}\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
w0\_m = (fabs.f64 w0)
w0\_s = (copysign.f64 #s(literal 1 binary64) w0)
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0_s w0_m M_m D_m h l d)
 :precision binary64
 (*
  w0_s
  (if (<= (sqrt (- 1.0 (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)))) 2.0)
    (* w0_m 1.0)
    (*
     w0_m
     (sqrt
      (fma (* h -0.25) (* (/ (* D_m M_m) (* d d)) (/ (* D_m M_m) l)) 1.0))))))

C

D_m = fabs(D);
M_m = fabs(M);
w0\_m = fabs(w0);
w0\_s = copysign(1.0, w0);
assert(w0_m < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0_s, double w0_m, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if (sqrt((1.0 - (pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)))) <= 2.0) {
		tmp = w0_m * 1.0;
	} else {
		tmp = w0_m * sqrt(fma((h * -0.25), (((D_m * M_m) / (d * d)) * ((D_m * M_m) / l)), 1.0));
	}
	return w0_s * tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0\_m = abs(w0)
w0\_s = copysign(1.0, w0)
w0_m, M_m, D_m, h, l, d = sort([w0_m, M_m, D_m, h, l, d])
function code(w0_s, w0_m, M_m, D_m, h, l, d)
	tmp = 0.0
	if (sqrt(Float64(1.0 - Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)))) <= 2.0)
		tmp = Float64(w0_m * 1.0);
	else
		tmp = Float64(w0_m * sqrt(fma(Float64(h * -0.25), Float64(Float64(Float64(D_m * M_m) / Float64(d * d)) * Float64(Float64(D_m * M_m) / l)), 1.0)));
	end
	return Float64(w0_s * tmp)
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
w0\_m = N[Abs[w0], $MachinePrecision]
w0\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[w0]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0$95$s_, w0$95$m_, M$95$m_, D$95$m_, h_, l_, d_] := N[(w0$95$s * If[LessEqual[N[Sqrt[N[(1.0 - N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], N[(w0$95$m * 1.0), $MachinePrecision], N[(w0$95$m * N[Sqrt[N[(N[(h * -0.25), $MachinePrecision] * N[(N[(N[(D$95$m * M$95$m), $MachinePrecision] / N[(d * d), $MachinePrecision]), $MachinePrecision] * N[(N[(D$95$m * M$95$m), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (sqrt.f64 (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)))) < 2

   1. Initial program 100.0%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 100.0%

      \[\leadsto w0 \cdot \color{blue}{1} \]

   if 2 < (sqrt.f64 (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))))

   1. Initial program 51.1%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in h around inf

      \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{1}{h} - \frac{1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)}} \]
   4. Step-by-step derivation

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

         \[\leadsto w0 \cdot \sqrt{h \cdot \color{blue}{\left(\frac{1}{h} + \left(\mathsf{neg}\left(\frac{1}{4}\right)\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)}} \]

      2. metadata-eval N/A

         \[\leadsto w0 \cdot \sqrt{h \cdot \left(\frac{1}{h} + \color{blue}{\frac{-1}{4}} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)} \]

      3. +-commutative N/A

         \[\leadsto w0 \cdot \sqrt{h \cdot \color{blue}{\left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \frac{1}{h}\right)}} \]

      4. distribute-lft-in N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right) + h \cdot \frac{1}{h}}} \]

      5. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}} + h \cdot \frac{1}{h}} \]

      6. rgt-mult-inverse N/A

         \[\leadsto w0 \cdot \sqrt{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \color{blue}{1}} \]

      7. lower-fma.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot \frac{-1}{4}, \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}, 1\right)}} \]

   5. Applied rewrites 46.8%

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\left(M \cdot M\right) \cdot D\right) \cdot D}{\left(d \cdot d\right) \cdot \ell}, 1\right)}} \]
   6. Step-by-step derivation

   7. Applied rewrites 46.8%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\left(M \cdot D\right) \cdot D\right) \cdot M}{\color{blue}{\left(d \cdot d\right)} \cdot \ell}, 1\right)} \]
   8. Step-by-step derivation

   9. Applied rewrites 55.2%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \frac{D \cdot M}{d \cdot d} \cdot \color{blue}{\frac{D \cdot M}{\ell}}, 1\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 83.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ w0\_m = \left|w0\right| \\ w0\_s = \mathsf{copysign}\left(1, w0\right) \\ [w0_m, M_m, D_m, h, l, d] = \mathsf{sort}([w0_m, M_m, D_m, h, l, d])\\ \\ w0\_s \cdot \begin{array}{l} \mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -1 \cdot 10^{+45}:\\ \;\;\;\;w0\_m \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \left(\left(\frac{M\_m}{d} \cdot M\_m\right) \cdot D\_m\right) \cdot \frac{D\_m}{d \cdot \ell}, 1\right)}\\ \mathbf{else}:\\ \;\;\;\;w0\_m \cdot 1\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
w0\_m = (fabs.f64 w0)
w0\_s = (copysign.f64 #s(literal 1 binary64) w0)
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0_s w0_m M_m D_m h l d)
 :precision binary64
 (*
  w0_s
  (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -1e+45)
    (*
     w0_m
     (sqrt
      (fma (* h -0.25) (* (* (* (/ M_m d) M_m) D_m) (/ D_m (* d l))) 1.0)))
    (* w0_m 1.0))))

C

D_m = fabs(D);
M_m = fabs(M);
w0\_m = fabs(w0);
w0\_s = copysign(1.0, w0);
assert(w0_m < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0_s, double w0_m, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -1e+45) {
		tmp = w0_m * sqrt(fma((h * -0.25), ((((M_m / d) * M_m) * D_m) * (D_m / (d * l))), 1.0));
	} else {
		tmp = w0_m * 1.0;
	}
	return w0_s * tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0\_m = abs(w0)
w0\_s = copysign(1.0, w0)
w0_m, M_m, D_m, h, l, d = sort([w0_m, M_m, D_m, h, l, d])
function code(w0_s, w0_m, M_m, D_m, h, l, d)
	tmp = 0.0
	if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -1e+45)
		tmp = Float64(w0_m * sqrt(fma(Float64(h * -0.25), Float64(Float64(Float64(Float64(M_m / d) * M_m) * D_m) * Float64(D_m / Float64(d * l))), 1.0)));
	else
		tmp = Float64(w0_m * 1.0);
	end
	return Float64(w0_s * tmp)
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
w0\_m = N[Abs[w0], $MachinePrecision]
w0\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[w0]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0$95$s_, w0$95$m_, M$95$m_, D$95$m_, h_, l_, d_] := N[(w0$95$s * If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -1e+45], N[(w0$95$m * N[Sqrt[N[(N[(h * -0.25), $MachinePrecision] * N[(N[(N[(N[(M$95$m / d), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(D$95$m / N[(d * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0$95$m * 1.0), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -9.9999999999999993e44

   1. Initial program 60.4%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in h around inf

      \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{1}{h} - \frac{1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)}} \]
   4. Step-by-step derivation

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

         \[\leadsto w0 \cdot \sqrt{h \cdot \color{blue}{\left(\frac{1}{h} + \left(\mathsf{neg}\left(\frac{1}{4}\right)\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)}} \]

      2. metadata-eval N/A

         \[\leadsto w0 \cdot \sqrt{h \cdot \left(\frac{1}{h} + \color{blue}{\frac{-1}{4}} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)} \]

      3. +-commutative N/A

         \[\leadsto w0 \cdot \sqrt{h \cdot \color{blue}{\left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \frac{1}{h}\right)}} \]

      4. distribute-lft-in N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right) + h \cdot \frac{1}{h}}} \]

      5. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}} + h \cdot \frac{1}{h}} \]

      6. rgt-mult-inverse N/A

         \[\leadsto w0 \cdot \sqrt{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \color{blue}{1}} \]

      7. lower-fma.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot \frac{-1}{4}, \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}, 1\right)}} \]

   5. Applied rewrites 49.0%

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\left(M \cdot M\right) \cdot D\right) \cdot D}{\left(d \cdot d\right) \cdot \ell}, 1\right)}} \]
   6. Step-by-step derivation

   7. Applied rewrites 54.4%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \left(\left(\frac{M}{d} \cdot M\right) \cdot D\right) \cdot \color{blue}{\frac{D}{d \cdot \ell}}, 1\right)} \]

   if -9.9999999999999993e44 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))

   1. Initial program 91.4%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 95.7%

      \[\leadsto w0 \cdot \color{blue}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 82.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ w0\_m = \left|w0\right| \\ w0\_s = \mathsf{copysign}\left(1, w0\right) \\ [w0_m, M_m, D_m, h, l, d] = \mathsf{sort}([w0_m, M_m, D_m, h, l, d])\\ \\ w0\_s \cdot \begin{array}{l} \mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -1 \cdot 10^{+92}:\\ \;\;\;\;w0\_m \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\left(M\_m \cdot D\_m\right) \cdot D\_m\right) \cdot M\_m}{\left(\ell \cdot d\right) \cdot d}, 1\right)}\\ \mathbf{else}:\\ \;\;\;\;w0\_m \cdot 1\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
w0\_m = (fabs.f64 w0)
w0\_s = (copysign.f64 #s(literal 1 binary64) w0)
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0_s w0_m M_m D_m h l d)
 :precision binary64
 (*
  w0_s
  (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -1e+92)
    (*
     w0_m
     (sqrt
      (fma (* h -0.25) (/ (* (* (* M_m D_m) D_m) M_m) (* (* l d) d)) 1.0)))
    (* w0_m 1.0))))

C

D_m = fabs(D);
M_m = fabs(M);
w0\_m = fabs(w0);
w0\_s = copysign(1.0, w0);
assert(w0_m < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0_s, double w0_m, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -1e+92) {
		tmp = w0_m * sqrt(fma((h * -0.25), ((((M_m * D_m) * D_m) * M_m) / ((l * d) * d)), 1.0));
	} else {
		tmp = w0_m * 1.0;
	}
	return w0_s * tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0\_m = abs(w0)
w0\_s = copysign(1.0, w0)
w0_m, M_m, D_m, h, l, d = sort([w0_m, M_m, D_m, h, l, d])
function code(w0_s, w0_m, M_m, D_m, h, l, d)
	tmp = 0.0
	if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -1e+92)
		tmp = Float64(w0_m * sqrt(fma(Float64(h * -0.25), Float64(Float64(Float64(Float64(M_m * D_m) * D_m) * M_m) / Float64(Float64(l * d) * d)), 1.0)));
	else
		tmp = Float64(w0_m * 1.0);
	end
	return Float64(w0_s * tmp)
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
w0\_m = N[Abs[w0], $MachinePrecision]
w0\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[w0]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0$95$s_, w0$95$m_, M$95$m_, D$95$m_, h_, l_, d_] := N[(w0$95$s * If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -1e+92], N[(w0$95$m * N[Sqrt[N[(N[(h * -0.25), $MachinePrecision] * N[(N[(N[(N[(M$95$m * D$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] * M$95$m), $MachinePrecision] / N[(N[(l * d), $MachinePrecision] * d), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0$95$m * 1.0), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -1e92

   1. Initial program 60.0%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in h around inf

      \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{1}{h} - \frac{1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)}} \]
   4. Step-by-step derivation

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

         \[\leadsto w0 \cdot \sqrt{h \cdot \color{blue}{\left(\frac{1}{h} + \left(\mathsf{neg}\left(\frac{1}{4}\right)\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)}} \]

      2. metadata-eval N/A

         \[\leadsto w0 \cdot \sqrt{h \cdot \left(\frac{1}{h} + \color{blue}{\frac{-1}{4}} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)} \]

      3. +-commutative N/A

         \[\leadsto w0 \cdot \sqrt{h \cdot \color{blue}{\left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \frac{1}{h}\right)}} \]

      4. distribute-lft-in N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right) + h \cdot \frac{1}{h}}} \]

      5. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}} + h \cdot \frac{1}{h}} \]

      6. rgt-mult-inverse N/A

         \[\leadsto w0 \cdot \sqrt{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \color{blue}{1}} \]

      7. lower-fma.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot \frac{-1}{4}, \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}, 1\right)}} \]

   5. Applied rewrites 49.7%

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\left(M \cdot M\right) \cdot D\right) \cdot D}{\left(d \cdot d\right) \cdot \ell}, 1\right)}} \]
   6. Step-by-step derivation

   7. Applied rewrites 48.6%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\left(M \cdot D\right) \cdot D\right) \cdot M}{\color{blue}{\left(d \cdot d\right)} \cdot \ell}, 1\right)} \]
   8. Step-by-step derivation

   9. Applied rewrites 52.2%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\left(M \cdot D\right) \cdot D\right) \cdot M}{\left(\ell \cdot d\right) \cdot \color{blue}{d}}, 1\right)} \]

   if -1e92 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))

   1. Initial program 91.4%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 95.2%

      \[\leadsto w0 \cdot \color{blue}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 81.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ w0\_m = \left|w0\right| \\ w0\_s = \mathsf{copysign}\left(1, w0\right) \\ [w0_m, M_m, D_m, h, l, d] = \mathsf{sort}([w0_m, M_m, D_m, h, l, d])\\ \\ w0\_s \cdot \begin{array}{l} \mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -1 \cdot 10^{+92}:\\ \;\;\;\;w0\_m \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, M\_m \cdot \left(\left(M\_m \cdot D\_m\right) \cdot \frac{D\_m}{\left(d \cdot d\right) \cdot \ell}\right), 1\right)}\\ \mathbf{else}:\\ \;\;\;\;w0\_m \cdot 1\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
w0\_m = (fabs.f64 w0)
w0\_s = (copysign.f64 #s(literal 1 binary64) w0)
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0_s w0_m M_m D_m h l d)
 :precision binary64
 (*
  w0_s
  (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -1e+92)
    (*
     w0_m
     (sqrt
      (fma (* h -0.25) (* M_m (* (* M_m D_m) (/ D_m (* (* d d) l)))) 1.0)))
    (* w0_m 1.0))))

C

D_m = fabs(D);
M_m = fabs(M);
w0\_m = fabs(w0);
w0\_s = copysign(1.0, w0);
assert(w0_m < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0_s, double w0_m, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -1e+92) {
		tmp = w0_m * sqrt(fma((h * -0.25), (M_m * ((M_m * D_m) * (D_m / ((d * d) * l)))), 1.0));
	} else {
		tmp = w0_m * 1.0;
	}
	return w0_s * tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0\_m = abs(w0)
w0\_s = copysign(1.0, w0)
w0_m, M_m, D_m, h, l, d = sort([w0_m, M_m, D_m, h, l, d])
function code(w0_s, w0_m, M_m, D_m, h, l, d)
	tmp = 0.0
	if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -1e+92)
		tmp = Float64(w0_m * sqrt(fma(Float64(h * -0.25), Float64(M_m * Float64(Float64(M_m * D_m) * Float64(D_m / Float64(Float64(d * d) * l)))), 1.0)));
	else
		tmp = Float64(w0_m * 1.0);
	end
	return Float64(w0_s * tmp)
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
w0\_m = N[Abs[w0], $MachinePrecision]
w0\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[w0]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0$95$s_, w0$95$m_, M$95$m_, D$95$m_, h_, l_, d_] := N[(w0$95$s * If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -1e+92], N[(w0$95$m * N[Sqrt[N[(N[(h * -0.25), $MachinePrecision] * N[(M$95$m * N[(N[(M$95$m * D$95$m), $MachinePrecision] * N[(D$95$m / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0$95$m * 1.0), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -1e92

   1. Initial program 60.0%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in h around inf

      \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{1}{h} - \frac{1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)}} \]
   4. Step-by-step derivation

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

         \[\leadsto w0 \cdot \sqrt{h \cdot \color{blue}{\left(\frac{1}{h} + \left(\mathsf{neg}\left(\frac{1}{4}\right)\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)}} \]

      2. metadata-eval N/A

         \[\leadsto w0 \cdot \sqrt{h \cdot \left(\frac{1}{h} + \color{blue}{\frac{-1}{4}} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)} \]

      3. +-commutative N/A

         \[\leadsto w0 \cdot \sqrt{h \cdot \color{blue}{\left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \frac{1}{h}\right)}} \]

      4. distribute-lft-in N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right) + h \cdot \frac{1}{h}}} \]

      5. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}} + h \cdot \frac{1}{h}} \]

      6. rgt-mult-inverse N/A

         \[\leadsto w0 \cdot \sqrt{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \color{blue}{1}} \]

      7. lower-fma.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot \frac{-1}{4}, \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}, 1\right)}} \]

   5. Applied rewrites 49.7%

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\left(M \cdot M\right) \cdot D\right) \cdot D}{\left(d \cdot d\right) \cdot \ell}, 1\right)}} \]
   6. Step-by-step derivation

   7. Applied rewrites 50.1%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, M \cdot \color{blue}{\left(\left(M \cdot D\right) \cdot \frac{D}{\left(d \cdot d\right) \cdot \ell}\right)}, 1\right)} \]

   if -1e92 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))

   1. Initial program 91.4%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 95.2%

      \[\leadsto w0 \cdot \color{blue}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 73.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ w0\_m = \left|w0\right| \\ w0\_s = \mathsf{copysign}\left(1, w0\right) \\ [w0_m, M_m, D_m, h, l, d] = \mathsf{sort}([w0_m, M_m, D_m, h, l, d])\\ \\ w0\_s \cdot \begin{array}{l} \mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -2 \cdot 10^{+127}:\\ \;\;\;\;w0\_m \cdot \sqrt{1 - \frac{\left(\left(M\_m \cdot D\_m\right) \cdot \left(M\_m \cdot D\_m\right)\right) \cdot \left(-h\right)}{\left(-2 \cdot d\right) \cdot \ell}}\\ \mathbf{else}:\\ \;\;\;\;w0\_m \cdot 1\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
w0\_m = (fabs.f64 w0)
w0\_s = (copysign.f64 #s(literal 1 binary64) w0)
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0_s w0_m M_m D_m h l d)
 :precision binary64
 (*
  w0_s
  (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -2e+127)
    (*
     w0_m
     (sqrt (- 1.0 (/ (* (* (* M_m D_m) (* M_m D_m)) (- h)) (* (* -2.0 d) l)))))
    (* w0_m 1.0))))

C

D_m = fabs(D);
M_m = fabs(M);
w0\_m = fabs(w0);
w0\_s = copysign(1.0, w0);
assert(w0_m < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0_s, double w0_m, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -2e+127) {
		tmp = w0_m * sqrt((1.0 - ((((M_m * D_m) * (M_m * D_m)) * -h) / ((-2.0 * d) * l))));
	} else {
		tmp = w0_m * 1.0;
	}
	return w0_s * tmp;
}

Fortran

D_m =     private
M_m =     private
w0\_m =     private
w0\_s =     private
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
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(w0_s, w0_m, m_m, d_m, h, l, d)
use fmin_fmax_functions
    real(8), intent (in) :: w0_s
    real(8), intent (in) :: w0_m
    real(8), intent (in) :: m_m
    real(8), intent (in) :: d_m
    real(8), intent (in) :: h
    real(8), intent (in) :: l
    real(8), intent (in) :: d
    real(8) :: tmp
    if (((((m_m * d_m) / (2.0d0 * d)) ** 2.0d0) * (h / l)) <= (-2d+127)) then
        tmp = w0_m * sqrt((1.0d0 - ((((m_m * d_m) * (m_m * d_m)) * -h) / (((-2.0d0) * d) * l))))
    else
        tmp = w0_m * 1.0d0
    end if
    code = w0_s * tmp
end function

Java

D_m = Math.abs(D);
M_m = Math.abs(M);
w0\_m = Math.abs(w0);
w0\_s = Math.copySign(1.0, w0);
assert w0_m < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0_s, double w0_m, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((Math.pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -2e+127) {
		tmp = w0_m * Math.sqrt((1.0 - ((((M_m * D_m) * (M_m * D_m)) * -h) / ((-2.0 * d) * l))));
	} else {
		tmp = w0_m * 1.0;
	}
	return w0_s * tmp;
}

Python

D_m = math.fabs(D)
M_m = math.fabs(M)
w0\_m = math.fabs(w0)
w0\_s = math.copysign(1.0, w0)
[w0_m, M_m, D_m, h, l, d] = sort([w0_m, M_m, D_m, h, l, d])
def code(w0_s, w0_m, M_m, D_m, h, l, d):
	tmp = 0
	if (math.pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -2e+127:
		tmp = w0_m * math.sqrt((1.0 - ((((M_m * D_m) * (M_m * D_m)) * -h) / ((-2.0 * d) * l))))
	else:
		tmp = w0_m * 1.0
	return w0_s * tmp

Julia

D_m = abs(D)
M_m = abs(M)
w0\_m = abs(w0)
w0\_s = copysign(1.0, w0)
w0_m, M_m, D_m, h, l, d = sort([w0_m, M_m, D_m, h, l, d])
function code(w0_s, w0_m, M_m, D_m, h, l, d)
	tmp = 0.0
	if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -2e+127)
		tmp = Float64(w0_m * sqrt(Float64(1.0 - Float64(Float64(Float64(Float64(M_m * D_m) * Float64(M_m * D_m)) * Float64(-h)) / Float64(Float64(-2.0 * d) * l)))));
	else
		tmp = Float64(w0_m * 1.0);
	end
	return Float64(w0_s * tmp)
end

MATLAB

D_m = abs(D);
M_m = abs(M);
w0\_m = abs(w0);
w0\_s = sign(w0) * abs(1.0);
w0_m, M_m, D_m, h, l, d = num2cell(sort([w0_m, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0_s, w0_m, M_m, D_m, h, l, d)
	tmp = 0.0;
	if (((((M_m * D_m) / (2.0 * d)) ^ 2.0) * (h / l)) <= -2e+127)
		tmp = w0_m * sqrt((1.0 - ((((M_m * D_m) * (M_m * D_m)) * -h) / ((-2.0 * d) * l))));
	else
		tmp = w0_m * 1.0;
	end
	tmp_2 = w0_s * tmp;
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
w0\_m = N[Abs[w0], $MachinePrecision]
w0\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[w0]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0$95$s_, w0$95$m_, M$95$m_, D$95$m_, h_, l_, d_] := N[(w0$95$s * If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -2e+127], N[(w0$95$m * N[Sqrt[N[(1.0 - N[(N[(N[(N[(M$95$m * D$95$m), $MachinePrecision] * N[(M$95$m * D$95$m), $MachinePrecision]), $MachinePrecision] * (-h)), $MachinePrecision] / N[(N[(-2.0 * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0$95$m * 1.0), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -1.99999999999999991e127

   1. Initial program 57.9%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   4. Applied rewrites 16.9%

      \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{\frac{\left(-{\left(D \cdot M\right)}^{2}\right) \cdot h}{\left(-2 \cdot d\right) \cdot \ell}}} \]

   5. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \sqrt{1 - \frac{\color{blue}{-1 \cdot \left({D}^{2} \cdot \left({M}^{2} \cdot h\right)\right)}}{\left(-2 \cdot d\right) \cdot \ell}} \]
   6. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{\color{blue}{\mathsf{neg}\left({D}^{2} \cdot \left({M}^{2} \cdot h\right)\right)}}{\left(-2 \cdot d\right) \cdot \ell}} \]

      2. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{\mathsf{neg}\left(\color{blue}{\left({D}^{2} \cdot {M}^{2}\right) \cdot h}\right)}{\left(-2 \cdot d\right) \cdot \ell}} \]

      3. distribute-rgt-neg-in N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{\color{blue}{\left({D}^{2} \cdot {M}^{2}\right) \cdot \left(\mathsf{neg}\left(h\right)\right)}}{\left(-2 \cdot d\right) \cdot \ell}} \]

      4. lower-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{\color{blue}{\left({D}^{2} \cdot {M}^{2}\right) \cdot \left(\mathsf{neg}\left(h\right)\right)}}{\left(-2 \cdot d\right) \cdot \ell}} \]

      5. unpow2 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\color{blue}{\left(D \cdot D\right)} \cdot {M}^{2}\right) \cdot \left(\mathsf{neg}\left(h\right)\right)}{\left(-2 \cdot d\right) \cdot \ell}} \]

      6. unpow2 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\left(D \cdot D\right) \cdot \color{blue}{\left(M \cdot M\right)}\right) \cdot \left(\mathsf{neg}\left(h\right)\right)}{\left(-2 \cdot d\right) \cdot \ell}} \]

      7. unswap-sqr N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{\color{blue}{\left(\left(D \cdot M\right) \cdot \left(D \cdot M\right)\right)} \cdot \left(\mathsf{neg}\left(h\right)\right)}{\left(-2 \cdot d\right) \cdot \ell}} \]

      8. lower-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{\color{blue}{\left(\left(D \cdot M\right) \cdot \left(D \cdot M\right)\right)} \cdot \left(\mathsf{neg}\left(h\right)\right)}{\left(-2 \cdot d\right) \cdot \ell}} \]

      9. *-commutative N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\color{blue}{\left(M \cdot D\right)} \cdot \left(D \cdot M\right)\right) \cdot \left(\mathsf{neg}\left(h\right)\right)}{\left(-2 \cdot d\right) \cdot \ell}} \]

      10. lower-*.f64 N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\color{blue}{\left(M \cdot D\right)} \cdot \left(D \cdot M\right)\right) \cdot \left(\mathsf{neg}\left(h\right)\right)}{\left(-2 \cdot d\right) \cdot \ell}} \]

      11. *-commutative N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\left(M \cdot D\right) \cdot \color{blue}{\left(M \cdot D\right)}\right) \cdot \left(\mathsf{neg}\left(h\right)\right)}{\left(-2 \cdot d\right) \cdot \ell}} \]

      12. lower-*.f64 N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\left(M \cdot D\right) \cdot \color{blue}{\left(M \cdot D\right)}\right) \cdot \left(\mathsf{neg}\left(h\right)\right)}{\left(-2 \cdot d\right) \cdot \ell}} \]

      13. lower-neg.f64 16.9

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\left(M \cdot D\right) \cdot \left(M \cdot D\right)\right) \cdot \color{blue}{\left(-h\right)}}{\left(-2 \cdot d\right) \cdot \ell}} \]

   7. Applied rewrites 16.9%

      \[\leadsto w0 \cdot \sqrt{1 - \frac{\color{blue}{\left(\left(M \cdot D\right) \cdot \left(M \cdot D\right)\right) \cdot \left(-h\right)}}{\left(-2 \cdot d\right) \cdot \ell}} \]

   if -1.99999999999999991e127 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))

   1. Initial program 91.6%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 93.2%

      \[\leadsto w0 \cdot \color{blue}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 73.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ w0\_m = \left|w0\right| \\ w0\_s = \mathsf{copysign}\left(1, w0\right) \\ [w0_m, M_m, D_m, h, l, d] = \mathsf{sort}([w0_m, M_m, D_m, h, l, d])\\ \\ w0\_s \cdot \begin{array}{l} \mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -2 \cdot 10^{+127}:\\ \;\;\;\;w0\_m \cdot \sqrt{1 - \frac{\left(-D\_m\right) \cdot \left(M\_m \cdot \left(h \cdot \left(M\_m \cdot D\_m\right)\right)\right)}{\left(-2 \cdot d\right) \cdot \ell}}\\ \mathbf{else}:\\ \;\;\;\;w0\_m \cdot 1\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
w0\_m = (fabs.f64 w0)
w0\_s = (copysign.f64 #s(literal 1 binary64) w0)
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0_s w0_m M_m D_m h l d)
 :precision binary64
 (*
  w0_s
  (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -2e+127)
    (*
     w0_m
     (sqrt (- 1.0 (/ (* (- D_m) (* M_m (* h (* M_m D_m)))) (* (* -2.0 d) l)))))
    (* w0_m 1.0))))

C

D_m = fabs(D);
M_m = fabs(M);
w0\_m = fabs(w0);
w0\_s = copysign(1.0, w0);
assert(w0_m < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0_s, double w0_m, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -2e+127) {
		tmp = w0_m * sqrt((1.0 - ((-D_m * (M_m * (h * (M_m * D_m)))) / ((-2.0 * d) * l))));
	} else {
		tmp = w0_m * 1.0;
	}
	return w0_s * tmp;
}

Fortran

D_m =     private
M_m =     private
w0\_m =     private
w0\_s =     private
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
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(w0_s, w0_m, m_m, d_m, h, l, d)
use fmin_fmax_functions
    real(8), intent (in) :: w0_s
    real(8), intent (in) :: w0_m
    real(8), intent (in) :: m_m
    real(8), intent (in) :: d_m
    real(8), intent (in) :: h
    real(8), intent (in) :: l
    real(8), intent (in) :: d
    real(8) :: tmp
    if (((((m_m * d_m) / (2.0d0 * d)) ** 2.0d0) * (h / l)) <= (-2d+127)) then
        tmp = w0_m * sqrt((1.0d0 - ((-d_m * (m_m * (h * (m_m * d_m)))) / (((-2.0d0) * d) * l))))
    else
        tmp = w0_m * 1.0d0
    end if
    code = w0_s * tmp
end function

Java

D_m = Math.abs(D);
M_m = Math.abs(M);
w0\_m = Math.abs(w0);
w0\_s = Math.copySign(1.0, w0);
assert w0_m < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0_s, double w0_m, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((Math.pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -2e+127) {
		tmp = w0_m * Math.sqrt((1.0 - ((-D_m * (M_m * (h * (M_m * D_m)))) / ((-2.0 * d) * l))));
	} else {
		tmp = w0_m * 1.0;
	}
	return w0_s * tmp;
}

Python

D_m = math.fabs(D)
M_m = math.fabs(M)
w0\_m = math.fabs(w0)
w0\_s = math.copysign(1.0, w0)
[w0_m, M_m, D_m, h, l, d] = sort([w0_m, M_m, D_m, h, l, d])
def code(w0_s, w0_m, M_m, D_m, h, l, d):
	tmp = 0
	if (math.pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -2e+127:
		tmp = w0_m * math.sqrt((1.0 - ((-D_m * (M_m * (h * (M_m * D_m)))) / ((-2.0 * d) * l))))
	else:
		tmp = w0_m * 1.0
	return w0_s * tmp

Julia

D_m = abs(D)
M_m = abs(M)
w0\_m = abs(w0)
w0\_s = copysign(1.0, w0)
w0_m, M_m, D_m, h, l, d = sort([w0_m, M_m, D_m, h, l, d])
function code(w0_s, w0_m, M_m, D_m, h, l, d)
	tmp = 0.0
	if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -2e+127)
		tmp = Float64(w0_m * sqrt(Float64(1.0 - Float64(Float64(Float64(-D_m) * Float64(M_m * Float64(h * Float64(M_m * D_m)))) / Float64(Float64(-2.0 * d) * l)))));
	else
		tmp = Float64(w0_m * 1.0);
	end
	return Float64(w0_s * tmp)
end

MATLAB

D_m = abs(D);
M_m = abs(M);
w0\_m = abs(w0);
w0\_s = sign(w0) * abs(1.0);
w0_m, M_m, D_m, h, l, d = num2cell(sort([w0_m, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0_s, w0_m, M_m, D_m, h, l, d)
	tmp = 0.0;
	if (((((M_m * D_m) / (2.0 * d)) ^ 2.0) * (h / l)) <= -2e+127)
		tmp = w0_m * sqrt((1.0 - ((-D_m * (M_m * (h * (M_m * D_m)))) / ((-2.0 * d) * l))));
	else
		tmp = w0_m * 1.0;
	end
	tmp_2 = w0_s * tmp;
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
w0\_m = N[Abs[w0], $MachinePrecision]
w0\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[w0]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0$95$s_, w0$95$m_, M$95$m_, D$95$m_, h_, l_, d_] := N[(w0$95$s * If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -2e+127], N[(w0$95$m * N[Sqrt[N[(1.0 - N[(N[((-D$95$m) * N[(M$95$m * N[(h * N[(M$95$m * D$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(-2.0 * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0$95$m * 1.0), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -1.99999999999999991e127

   1. Initial program 57.9%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   4. Applied rewrites 16.9%

      \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{\frac{\left(-{\left(D \cdot M\right)}^{2}\right) \cdot h}{\left(-2 \cdot d\right) \cdot \ell}}} \]

   5. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \sqrt{1 - \frac{\color{blue}{-1 \cdot \left({D}^{2} \cdot \left({M}^{2} \cdot h\right)\right)}}{\left(-2 \cdot d\right) \cdot \ell}} \]
   6. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{\color{blue}{\mathsf{neg}\left({D}^{2} \cdot \left({M}^{2} \cdot h\right)\right)}}{\left(-2 \cdot d\right) \cdot \ell}} \]

      2. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{\mathsf{neg}\left(\color{blue}{\left({D}^{2} \cdot {M}^{2}\right) \cdot h}\right)}{\left(-2 \cdot d\right) \cdot \ell}} \]

      3. distribute-rgt-neg-in N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{\color{blue}{\left({D}^{2} \cdot {M}^{2}\right) \cdot \left(\mathsf{neg}\left(h\right)\right)}}{\left(-2 \cdot d\right) \cdot \ell}} \]

      4. lower-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{\color{blue}{\left({D}^{2} \cdot {M}^{2}\right) \cdot \left(\mathsf{neg}\left(h\right)\right)}}{\left(-2 \cdot d\right) \cdot \ell}} \]

      5. unpow2 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\color{blue}{\left(D \cdot D\right)} \cdot {M}^{2}\right) \cdot \left(\mathsf{neg}\left(h\right)\right)}{\left(-2 \cdot d\right) \cdot \ell}} \]

      6. unpow2 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\left(D \cdot D\right) \cdot \color{blue}{\left(M \cdot M\right)}\right) \cdot \left(\mathsf{neg}\left(h\right)\right)}{\left(-2 \cdot d\right) \cdot \ell}} \]

      7. unswap-sqr N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{\color{blue}{\left(\left(D \cdot M\right) \cdot \left(D \cdot M\right)\right)} \cdot \left(\mathsf{neg}\left(h\right)\right)}{\left(-2 \cdot d\right) \cdot \ell}} \]

      8. lower-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{\color{blue}{\left(\left(D \cdot M\right) \cdot \left(D \cdot M\right)\right)} \cdot \left(\mathsf{neg}\left(h\right)\right)}{\left(-2 \cdot d\right) \cdot \ell}} \]

      9. *-commutative N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\color{blue}{\left(M \cdot D\right)} \cdot \left(D \cdot M\right)\right) \cdot \left(\mathsf{neg}\left(h\right)\right)}{\left(-2 \cdot d\right) \cdot \ell}} \]

      10. lower-*.f64 N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\color{blue}{\left(M \cdot D\right)} \cdot \left(D \cdot M\right)\right) \cdot \left(\mathsf{neg}\left(h\right)\right)}{\left(-2 \cdot d\right) \cdot \ell}} \]

      11. *-commutative N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\left(M \cdot D\right) \cdot \color{blue}{\left(M \cdot D\right)}\right) \cdot \left(\mathsf{neg}\left(h\right)\right)}{\left(-2 \cdot d\right) \cdot \ell}} \]

      12. lower-*.f64 N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\left(M \cdot D\right) \cdot \color{blue}{\left(M \cdot D\right)}\right) \cdot \left(\mathsf{neg}\left(h\right)\right)}{\left(-2 \cdot d\right) \cdot \ell}} \]

      13. lower-neg.f64 16.9

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\left(M \cdot D\right) \cdot \left(M \cdot D\right)\right) \cdot \color{blue}{\left(-h\right)}}{\left(-2 \cdot d\right) \cdot \ell}} \]

   7. Applied rewrites 16.9%

      \[\leadsto w0 \cdot \sqrt{1 - \frac{\color{blue}{\left(\left(M \cdot D\right) \cdot \left(M \cdot D\right)\right) \cdot \left(-h\right)}}{\left(-2 \cdot d\right) \cdot \ell}} \]
   8. Step-by-step derivation

   9. Applied rewrites 16.8%

      \[\leadsto w0 \cdot \sqrt{1 - \frac{D \cdot \color{blue}{\left(M \cdot \left(\left(-h\right) \cdot \left(M \cdot D\right)\right)\right)}}{\left(-2 \cdot d\right) \cdot \ell}} \]

   if -1.99999999999999991e127 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))

   1. Initial program 91.6%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 93.2%

      \[\leadsto w0 \cdot \color{blue}{1} \]
3. Recombined 2 regimes into one program.

4. Final simplification 70.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -2 \cdot 10^{+127}:\\ \;\;\;\;w0 \cdot \sqrt{1 - \frac{\left(-D\right) \cdot \left(M \cdot \left(h \cdot \left(M \cdot D\right)\right)\right)}{\left(-2 \cdot d\right) \cdot \ell}}\\ \mathbf{else}:\\ \;\;\;\;w0 \cdot 1\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 79.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ w0\_m = \left|w0\right| \\ w0\_s = \mathsf{copysign}\left(1, w0\right) \\ [w0_m, M_m, D_m, h, l, d] = \mathsf{sort}([w0_m, M_m, D_m, h, l, d])\\ \\ w0\_s \cdot \begin{array}{l} \mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -2 \cdot 10^{+199}:\\ \;\;\;\;\mathsf{fma}\left(\frac{M\_m \cdot \left(\left(h \cdot M\_m\right) \cdot \left(\left(D\_m \cdot D\_m\right) \cdot w0\_m\right)\right)}{\left(d \cdot d\right) \cdot \ell}, -0.125, w0\_m\right)\\ \mathbf{else}:\\ \;\;\;\;w0\_m \cdot 1\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
w0\_m = (fabs.f64 w0)
w0\_s = (copysign.f64 #s(literal 1 binary64) w0)
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0_s w0_m M_m D_m h l d)
 :precision binary64
 (*
  w0_s
  (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -2e+199)
    (fma
     (/ (* M_m (* (* h M_m) (* (* D_m D_m) w0_m))) (* (* d d) l))
     -0.125
     w0_m)
    (* w0_m 1.0))))

C

D_m = fabs(D);
M_m = fabs(M);
w0\_m = fabs(w0);
w0\_s = copysign(1.0, w0);
assert(w0_m < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0_s, double w0_m, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -2e+199) {
		tmp = fma(((M_m * ((h * M_m) * ((D_m * D_m) * w0_m))) / ((d * d) * l)), -0.125, w0_m);
	} else {
		tmp = w0_m * 1.0;
	}
	return w0_s * tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0\_m = abs(w0)
w0\_s = copysign(1.0, w0)
w0_m, M_m, D_m, h, l, d = sort([w0_m, M_m, D_m, h, l, d])
function code(w0_s, w0_m, M_m, D_m, h, l, d)
	tmp = 0.0
	if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -2e+199)
		tmp = fma(Float64(Float64(M_m * Float64(Float64(h * M_m) * Float64(Float64(D_m * D_m) * w0_m))) / Float64(Float64(d * d) * l)), -0.125, w0_m);
	else
		tmp = Float64(w0_m * 1.0);
	end
	return Float64(w0_s * tmp)
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
w0\_m = N[Abs[w0], $MachinePrecision]
w0\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[w0]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0$95$s_, w0$95$m_, M$95$m_, D$95$m_, h_, l_, d_] := N[(w0$95$s * If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -2e+199], N[(N[(N[(M$95$m * N[(N[(h * M$95$m), $MachinePrecision] * N[(N[(D$95$m * D$95$m), $MachinePrecision] * w0$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * -0.125 + w0$95$m), $MachinePrecision], N[(w0$95$m * 1.0), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -2.00000000000000019e199

   1. Initial program 57.4%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}} \]

      2. *-commutative N/A

         \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{\frac{h}{\ell} \cdot {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}}} \]

      3. lift-pow.f64 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{h}{\ell} \cdot \color{blue}{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}}} \]

      4. unpow2 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{h}{\ell} \cdot \color{blue}{\left(\frac{M \cdot D}{2 \cdot d} \cdot \frac{M \cdot D}{2 \cdot d}\right)}} \]

      5. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \frac{M \cdot D}{2 \cdot d}}} \]

      6. lift-/.f64 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \color{blue}{\frac{M \cdot D}{2 \cdot d}}} \]

      7. frac-2neg N/A

         \[\leadsto w0 \cdot \sqrt{1 - \left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \color{blue}{\frac{\mathsf{neg}\left(M \cdot D\right)}{\mathsf{neg}\left(2 \cdot d\right)}}} \]

      8. associate-*r/ N/A

         \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{\frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\mathsf{neg}\left(2 \cdot d\right)}}} \]

      9. lift-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\mathsf{neg}\left(\color{blue}{2 \cdot d}\right)}} \]

      10. count-2-rev N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\mathsf{neg}\left(\color{blue}{\left(d + d\right)}\right)}} \]

      11. flip-+ N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\mathsf{neg}\left(\color{blue}{\frac{d \cdot d - d \cdot d}{d - d}}\right)}} \]

      12. distribute-neg-frac N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\color{blue}{\frac{\mathsf{neg}\left(\left(d \cdot d - d \cdot d\right)\right)}{d - d}}}} \]

      13. +-inverses N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\frac{\mathsf{neg}\left(\color{blue}{0}\right)}{d - d}}} \]

      14. metadata-eval N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\frac{\color{blue}{0}}{d - d}}} \]

      15. +-inverses N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\frac{\color{blue}{d \cdot d - d \cdot d}}{d - d}}} \]

      16. flip-+ N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\color{blue}{d + d}}} \]

      17. count-2-rev N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\color{blue}{2 \cdot d}}} \]

      18. lift-*.f64 N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\color{blue}{2 \cdot d}}} \]

      19. lower-/.f64 N/A

          \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{\frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{2 \cdot d}}} \]

   4. Applied rewrites 59.7%

      \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{\frac{\left(\left(\frac{h}{\ell} \cdot D\right) \cdot \frac{\frac{M}{d}}{2}\right) \cdot \left(\left(-M\right) \cdot D\right)}{-2 \cdot d}}} \]

   5. Taylor expanded in M around 0

      \[\leadsto \color{blue}{w0 + \frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell}} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell} + w0} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell} \cdot \frac{-1}{8}} + w0 \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right)} \]

      4. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell}}, \frac{-1}{8}, w0\right) \]

      5. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\frac{\color{blue}{\left({M}^{2} \cdot \left(h \cdot w0\right)\right) \cdot {D}^{2}}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{\color{blue}{\left({M}^{2} \cdot \left(h \cdot w0\right)\right) \cdot {D}^{2}}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      7. associate-*r* N/A

         \[\leadsto \mathsf{fma}\left(\frac{\color{blue}{\left(\left({M}^{2} \cdot h\right) \cdot w0\right)} \cdot {D}^{2}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{\color{blue}{\left(\left({M}^{2} \cdot h\right) \cdot w0\right)} \cdot {D}^{2}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      9. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{\left(\color{blue}{\left({M}^{2} \cdot h\right)} \cdot w0\right) \cdot {D}^{2}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      10. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\color{blue}{\left(M \cdot M\right)} \cdot h\right) \cdot w0\right) \cdot {D}^{2}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      11. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\color{blue}{\left(M \cdot M\right)} \cdot h\right) \cdot w0\right) \cdot {D}^{2}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      12. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \color{blue}{\left(D \cdot D\right)}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      13. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \color{blue}{\left(D \cdot D\right)}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      14. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \left(D \cdot D\right)}{\color{blue}{{d}^{2} \cdot \ell}}, \frac{-1}{8}, w0\right) \]

      15. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \left(D \cdot D\right)}{\color{blue}{\left(d \cdot d\right)} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      16. lower-*.f64 39.6

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \left(D \cdot D\right)}{\color{blue}{\left(d \cdot d\right)} \cdot \ell}, -0.125, w0\right) \]

   7. Applied rewrites 39.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \left(D \cdot D\right)}{\left(d \cdot d\right) \cdot \ell}, -0.125, w0\right)} \]
   8. Step-by-step derivation

   9. Applied rewrites 41.1%

      \[\leadsto \mathsf{fma}\left(\frac{M \cdot \left(\left(h \cdot M\right) \cdot \left(\left(D \cdot D\right) \cdot w0\right)\right)}{\left(d \cdot d\right) \cdot \ell}, -0.125, w0\right) \]

   if -2.00000000000000019e199 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))

   1. Initial program 91.6%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 92.7%

      \[\leadsto w0 \cdot \color{blue}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 11: 79.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ w0\_m = \left|w0\right| \\ w0\_s = \mathsf{copysign}\left(1, w0\right) \\ [w0_m, M_m, D_m, h, l, d] = \mathsf{sort}([w0_m, M_m, D_m, h, l, d])\\ \\ w0\_s \cdot \begin{array}{l} \mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -2 \cdot 10^{+199}:\\ \;\;\;\;\frac{M\_m \cdot \left(\left(h \cdot M\_m\right) \cdot \left(\left(D\_m \cdot D\_m\right) \cdot w0\_m\right)\right)}{\left(d \cdot d\right) \cdot \ell} \cdot -0.125\\ \mathbf{else}:\\ \;\;\;\;w0\_m \cdot 1\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
w0\_m = (fabs.f64 w0)
w0\_s = (copysign.f64 #s(literal 1 binary64) w0)
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0_s w0_m M_m D_m h l d)
 :precision binary64
 (*
  w0_s
  (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -2e+199)
    (* (/ (* M_m (* (* h M_m) (* (* D_m D_m) w0_m))) (* (* d d) l)) -0.125)
    (* w0_m 1.0))))

C

D_m = fabs(D);
M_m = fabs(M);
w0\_m = fabs(w0);
w0\_s = copysign(1.0, w0);
assert(w0_m < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0_s, double w0_m, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -2e+199) {
		tmp = ((M_m * ((h * M_m) * ((D_m * D_m) * w0_m))) / ((d * d) * l)) * -0.125;
	} else {
		tmp = w0_m * 1.0;
	}
	return w0_s * tmp;
}

Fortran

D_m =     private
M_m =     private
w0\_m =     private
w0\_s =     private
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
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(w0_s, w0_m, m_m, d_m, h, l, d)
use fmin_fmax_functions
    real(8), intent (in) :: w0_s
    real(8), intent (in) :: w0_m
    real(8), intent (in) :: m_m
    real(8), intent (in) :: d_m
    real(8), intent (in) :: h
    real(8), intent (in) :: l
    real(8), intent (in) :: d
    real(8) :: tmp
    if (((((m_m * d_m) / (2.0d0 * d)) ** 2.0d0) * (h / l)) <= (-2d+199)) then
        tmp = ((m_m * ((h * m_m) * ((d_m * d_m) * w0_m))) / ((d * d) * l)) * (-0.125d0)
    else
        tmp = w0_m * 1.0d0
    end if
    code = w0_s * tmp
end function

Java

D_m = Math.abs(D);
M_m = Math.abs(M);
w0\_m = Math.abs(w0);
w0\_s = Math.copySign(1.0, w0);
assert w0_m < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0_s, double w0_m, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((Math.pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -2e+199) {
		tmp = ((M_m * ((h * M_m) * ((D_m * D_m) * w0_m))) / ((d * d) * l)) * -0.125;
	} else {
		tmp = w0_m * 1.0;
	}
	return w0_s * tmp;
}

Python

D_m = math.fabs(D)
M_m = math.fabs(M)
w0\_m = math.fabs(w0)
w0\_s = math.copysign(1.0, w0)
[w0_m, M_m, D_m, h, l, d] = sort([w0_m, M_m, D_m, h, l, d])
def code(w0_s, w0_m, M_m, D_m, h, l, d):
	tmp = 0
	if (math.pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -2e+199:
		tmp = ((M_m * ((h * M_m) * ((D_m * D_m) * w0_m))) / ((d * d) * l)) * -0.125
	else:
		tmp = w0_m * 1.0
	return w0_s * tmp

Julia

D_m = abs(D)
M_m = abs(M)
w0\_m = abs(w0)
w0\_s = copysign(1.0, w0)
w0_m, M_m, D_m, h, l, d = sort([w0_m, M_m, D_m, h, l, d])
function code(w0_s, w0_m, M_m, D_m, h, l, d)
	tmp = 0.0
	if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -2e+199)
		tmp = Float64(Float64(Float64(M_m * Float64(Float64(h * M_m) * Float64(Float64(D_m * D_m) * w0_m))) / Float64(Float64(d * d) * l)) * -0.125);
	else
		tmp = Float64(w0_m * 1.0);
	end
	return Float64(w0_s * tmp)
end

MATLAB

D_m = abs(D);
M_m = abs(M);
w0\_m = abs(w0);
w0\_s = sign(w0) * abs(1.0);
w0_m, M_m, D_m, h, l, d = num2cell(sort([w0_m, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0_s, w0_m, M_m, D_m, h, l, d)
	tmp = 0.0;
	if (((((M_m * D_m) / (2.0 * d)) ^ 2.0) * (h / l)) <= -2e+199)
		tmp = ((M_m * ((h * M_m) * ((D_m * D_m) * w0_m))) / ((d * d) * l)) * -0.125;
	else
		tmp = w0_m * 1.0;
	end
	tmp_2 = w0_s * tmp;
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
w0\_m = N[Abs[w0], $MachinePrecision]
w0\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[w0]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0$95$s_, w0$95$m_, M$95$m_, D$95$m_, h_, l_, d_] := N[(w0$95$s * If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -2e+199], N[(N[(N[(M$95$m * N[(N[(h * M$95$m), $MachinePrecision] * N[(N[(D$95$m * D$95$m), $MachinePrecision] * w0$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] * -0.125), $MachinePrecision], N[(w0$95$m * 1.0), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -2.00000000000000019e199

   1. Initial program 57.4%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}} \]

      2. *-commutative N/A

         \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{\frac{h}{\ell} \cdot {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}}} \]

      3. lift-pow.f64 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{h}{\ell} \cdot \color{blue}{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}}} \]

      4. unpow2 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{h}{\ell} \cdot \color{blue}{\left(\frac{M \cdot D}{2 \cdot d} \cdot \frac{M \cdot D}{2 \cdot d}\right)}} \]

      5. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \frac{M \cdot D}{2 \cdot d}}} \]

      6. lift-/.f64 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \color{blue}{\frac{M \cdot D}{2 \cdot d}}} \]

      7. frac-2neg N/A

         \[\leadsto w0 \cdot \sqrt{1 - \left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \color{blue}{\frac{\mathsf{neg}\left(M \cdot D\right)}{\mathsf{neg}\left(2 \cdot d\right)}}} \]

      8. associate-*r/ N/A

         \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{\frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\mathsf{neg}\left(2 \cdot d\right)}}} \]

      9. lift-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\mathsf{neg}\left(\color{blue}{2 \cdot d}\right)}} \]

      10. count-2-rev N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\mathsf{neg}\left(\color{blue}{\left(d + d\right)}\right)}} \]

      11. flip-+ N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\mathsf{neg}\left(\color{blue}{\frac{d \cdot d - d \cdot d}{d - d}}\right)}} \]

      12. distribute-neg-frac N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\color{blue}{\frac{\mathsf{neg}\left(\left(d \cdot d - d \cdot d\right)\right)}{d - d}}}} \]

      13. +-inverses N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\frac{\mathsf{neg}\left(\color{blue}{0}\right)}{d - d}}} \]

      14. metadata-eval N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\frac{\color{blue}{0}}{d - d}}} \]

      15. +-inverses N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\frac{\color{blue}{d \cdot d - d \cdot d}}{d - d}}} \]

      16. flip-+ N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\color{blue}{d + d}}} \]

      17. count-2-rev N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\color{blue}{2 \cdot d}}} \]

      18. lift-*.f64 N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\color{blue}{2 \cdot d}}} \]

      19. lower-/.f64 N/A

          \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{\frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{2 \cdot d}}} \]

   4. Applied rewrites 59.7%

      \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{\frac{\left(\left(\frac{h}{\ell} \cdot D\right) \cdot \frac{\frac{M}{d}}{2}\right) \cdot \left(\left(-M\right) \cdot D\right)}{-2 \cdot d}}} \]

   5. Taylor expanded in M around 0

      \[\leadsto \color{blue}{w0 + \frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell}} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell} + w0} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell} \cdot \frac{-1}{8}} + w0 \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right)} \]

      4. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell}}, \frac{-1}{8}, w0\right) \]

      5. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\frac{\color{blue}{\left({M}^{2} \cdot \left(h \cdot w0\right)\right) \cdot {D}^{2}}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{\color{blue}{\left({M}^{2} \cdot \left(h \cdot w0\right)\right) \cdot {D}^{2}}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      7. associate-*r* N/A

         \[\leadsto \mathsf{fma}\left(\frac{\color{blue}{\left(\left({M}^{2} \cdot h\right) \cdot w0\right)} \cdot {D}^{2}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{\color{blue}{\left(\left({M}^{2} \cdot h\right) \cdot w0\right)} \cdot {D}^{2}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      9. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{\left(\color{blue}{\left({M}^{2} \cdot h\right)} \cdot w0\right) \cdot {D}^{2}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      10. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\color{blue}{\left(M \cdot M\right)} \cdot h\right) \cdot w0\right) \cdot {D}^{2}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      11. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\color{blue}{\left(M \cdot M\right)} \cdot h\right) \cdot w0\right) \cdot {D}^{2}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      12. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \color{blue}{\left(D \cdot D\right)}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      13. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \color{blue}{\left(D \cdot D\right)}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      14. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \left(D \cdot D\right)}{\color{blue}{{d}^{2} \cdot \ell}}, \frac{-1}{8}, w0\right) \]

      15. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \left(D \cdot D\right)}{\color{blue}{\left(d \cdot d\right)} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      16. lower-*.f64 39.6

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \left(D \cdot D\right)}{\color{blue}{\left(d \cdot d\right)} \cdot \ell}, -0.125, w0\right) \]

   7. Applied rewrites 39.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \left(D \cdot D\right)}{\left(d \cdot d\right) \cdot \ell}, -0.125, w0\right)} \]

   8. Taylor expanded in M around inf

      \[\leadsto \frac{-1}{8} \cdot \color{blue}{\frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell}} \]
   9. Step-by-step derivation

   10. Applied rewrites 39.6%

       \[\leadsto \frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \left(D \cdot D\right)}{\left(d \cdot d\right) \cdot \ell} \cdot \color{blue}{-0.125} \]
   11. Step-by-step derivation

   12. Applied rewrites 41.1%

       \[\leadsto \frac{M \cdot \left(\left(h \cdot M\right) \cdot \left(\left(D \cdot D\right) \cdot w0\right)\right)}{\left(d \cdot d\right) \cdot \ell} \cdot -0.125 \]

   if -2.00000000000000019e199 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))

   1. Initial program 91.6%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 92.7%

      \[\leadsto w0 \cdot \color{blue}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 12: 77.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ w0\_m = \left|w0\right| \\ w0\_s = \mathsf{copysign}\left(1, w0\right) \\ [w0_m, M_m, D_m, h, l, d] = \mathsf{sort}([w0_m, M_m, D_m, h, l, d])\\ \\ w0\_s \cdot \begin{array}{l} \mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -2 \cdot 10^{+199}:\\ \;\;\;\;\left(\left(\left(M\_m \cdot M\_m\right) \cdot h\right) \cdot \frac{\left(D\_m \cdot D\_m\right) \cdot w0\_m}{\left(d \cdot d\right) \cdot \ell}\right) \cdot -0.125\\ \mathbf{else}:\\ \;\;\;\;w0\_m \cdot 1\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
w0\_m = (fabs.f64 w0)
w0\_s = (copysign.f64 #s(literal 1 binary64) w0)
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0_s w0_m M_m D_m h l d)
 :precision binary64
 (*
  w0_s
  (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -2e+199)
    (* (* (* (* M_m M_m) h) (/ (* (* D_m D_m) w0_m) (* (* d d) l))) -0.125)
    (* w0_m 1.0))))

C

D_m = fabs(D);
M_m = fabs(M);
w0\_m = fabs(w0);
w0\_s = copysign(1.0, w0);
assert(w0_m < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0_s, double w0_m, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -2e+199) {
		tmp = (((M_m * M_m) * h) * (((D_m * D_m) * w0_m) / ((d * d) * l))) * -0.125;
	} else {
		tmp = w0_m * 1.0;
	}
	return w0_s * tmp;
}

Fortran

D_m =     private
M_m =     private
w0\_m =     private
w0\_s =     private
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
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(w0_s, w0_m, m_m, d_m, h, l, d)
use fmin_fmax_functions
    real(8), intent (in) :: w0_s
    real(8), intent (in) :: w0_m
    real(8), intent (in) :: m_m
    real(8), intent (in) :: d_m
    real(8), intent (in) :: h
    real(8), intent (in) :: l
    real(8), intent (in) :: d
    real(8) :: tmp
    if (((((m_m * d_m) / (2.0d0 * d)) ** 2.0d0) * (h / l)) <= (-2d+199)) then
        tmp = (((m_m * m_m) * h) * (((d_m * d_m) * w0_m) / ((d * d) * l))) * (-0.125d0)
    else
        tmp = w0_m * 1.0d0
    end if
    code = w0_s * tmp
end function

Java

D_m = Math.abs(D);
M_m = Math.abs(M);
w0\_m = Math.abs(w0);
w0\_s = Math.copySign(1.0, w0);
assert w0_m < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0_s, double w0_m, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((Math.pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -2e+199) {
		tmp = (((M_m * M_m) * h) * (((D_m * D_m) * w0_m) / ((d * d) * l))) * -0.125;
	} else {
		tmp = w0_m * 1.0;
	}
	return w0_s * tmp;
}

Python

D_m = math.fabs(D)
M_m = math.fabs(M)
w0\_m = math.fabs(w0)
w0\_s = math.copysign(1.0, w0)
[w0_m, M_m, D_m, h, l, d] = sort([w0_m, M_m, D_m, h, l, d])
def code(w0_s, w0_m, M_m, D_m, h, l, d):
	tmp = 0
	if (math.pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -2e+199:
		tmp = (((M_m * M_m) * h) * (((D_m * D_m) * w0_m) / ((d * d) * l))) * -0.125
	else:
		tmp = w0_m * 1.0
	return w0_s * tmp

Julia

D_m = abs(D)
M_m = abs(M)
w0\_m = abs(w0)
w0\_s = copysign(1.0, w0)
w0_m, M_m, D_m, h, l, d = sort([w0_m, M_m, D_m, h, l, d])
function code(w0_s, w0_m, M_m, D_m, h, l, d)
	tmp = 0.0
	if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -2e+199)
		tmp = Float64(Float64(Float64(Float64(M_m * M_m) * h) * Float64(Float64(Float64(D_m * D_m) * w0_m) / Float64(Float64(d * d) * l))) * -0.125);
	else
		tmp = Float64(w0_m * 1.0);
	end
	return Float64(w0_s * tmp)
end

MATLAB

D_m = abs(D);
M_m = abs(M);
w0\_m = abs(w0);
w0\_s = sign(w0) * abs(1.0);
w0_m, M_m, D_m, h, l, d = num2cell(sort([w0_m, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0_s, w0_m, M_m, D_m, h, l, d)
	tmp = 0.0;
	if (((((M_m * D_m) / (2.0 * d)) ^ 2.0) * (h / l)) <= -2e+199)
		tmp = (((M_m * M_m) * h) * (((D_m * D_m) * w0_m) / ((d * d) * l))) * -0.125;
	else
		tmp = w0_m * 1.0;
	end
	tmp_2 = w0_s * tmp;
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
w0\_m = N[Abs[w0], $MachinePrecision]
w0\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[w0]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0$95$s_, w0$95$m_, M$95$m_, D$95$m_, h_, l_, d_] := N[(w0$95$s * If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -2e+199], N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * h), $MachinePrecision] * N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * w0$95$m), $MachinePrecision] / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * -0.125), $MachinePrecision], N[(w0$95$m * 1.0), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -2.00000000000000019e199

   1. Initial program 57.4%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}} \]

      2. *-commutative N/A

         \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{\frac{h}{\ell} \cdot {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}}} \]

      3. lift-pow.f64 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{h}{\ell} \cdot \color{blue}{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}}} \]

      4. unpow2 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{h}{\ell} \cdot \color{blue}{\left(\frac{M \cdot D}{2 \cdot d} \cdot \frac{M \cdot D}{2 \cdot d}\right)}} \]

      5. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \frac{M \cdot D}{2 \cdot d}}} \]

      6. lift-/.f64 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \color{blue}{\frac{M \cdot D}{2 \cdot d}}} \]

      7. frac-2neg N/A

         \[\leadsto w0 \cdot \sqrt{1 - \left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \color{blue}{\frac{\mathsf{neg}\left(M \cdot D\right)}{\mathsf{neg}\left(2 \cdot d\right)}}} \]

      8. associate-*r/ N/A

         \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{\frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\mathsf{neg}\left(2 \cdot d\right)}}} \]

      9. lift-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\mathsf{neg}\left(\color{blue}{2 \cdot d}\right)}} \]

      10. count-2-rev N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\mathsf{neg}\left(\color{blue}{\left(d + d\right)}\right)}} \]

      11. flip-+ N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\mathsf{neg}\left(\color{blue}{\frac{d \cdot d - d \cdot d}{d - d}}\right)}} \]

      12. distribute-neg-frac N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\color{blue}{\frac{\mathsf{neg}\left(\left(d \cdot d - d \cdot d\right)\right)}{d - d}}}} \]

      13. +-inverses N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\frac{\mathsf{neg}\left(\color{blue}{0}\right)}{d - d}}} \]

      14. metadata-eval N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\frac{\color{blue}{0}}{d - d}}} \]

      15. +-inverses N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\frac{\color{blue}{d \cdot d - d \cdot d}}{d - d}}} \]

      16. flip-+ N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\color{blue}{d + d}}} \]

      17. count-2-rev N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\color{blue}{2 \cdot d}}} \]

      18. lift-*.f64 N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\color{blue}{2 \cdot d}}} \]

      19. lower-/.f64 N/A

          \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{\frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{2 \cdot d}}} \]

   4. Applied rewrites 59.7%

      \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{\frac{\left(\left(\frac{h}{\ell} \cdot D\right) \cdot \frac{\frac{M}{d}}{2}\right) \cdot \left(\left(-M\right) \cdot D\right)}{-2 \cdot d}}} \]

   5. Taylor expanded in M around 0

      \[\leadsto \color{blue}{w0 + \frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell}} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell} + w0} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell} \cdot \frac{-1}{8}} + w0 \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right)} \]

      4. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell}}, \frac{-1}{8}, w0\right) \]

      5. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\frac{\color{blue}{\left({M}^{2} \cdot \left(h \cdot w0\right)\right) \cdot {D}^{2}}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{\color{blue}{\left({M}^{2} \cdot \left(h \cdot w0\right)\right) \cdot {D}^{2}}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      7. associate-*r* N/A

         \[\leadsto \mathsf{fma}\left(\frac{\color{blue}{\left(\left({M}^{2} \cdot h\right) \cdot w0\right)} \cdot {D}^{2}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{\color{blue}{\left(\left({M}^{2} \cdot h\right) \cdot w0\right)} \cdot {D}^{2}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      9. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{\left(\color{blue}{\left({M}^{2} \cdot h\right)} \cdot w0\right) \cdot {D}^{2}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      10. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\color{blue}{\left(M \cdot M\right)} \cdot h\right) \cdot w0\right) \cdot {D}^{2}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      11. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\color{blue}{\left(M \cdot M\right)} \cdot h\right) \cdot w0\right) \cdot {D}^{2}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      12. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \color{blue}{\left(D \cdot D\right)}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      13. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \color{blue}{\left(D \cdot D\right)}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      14. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \left(D \cdot D\right)}{\color{blue}{{d}^{2} \cdot \ell}}, \frac{-1}{8}, w0\right) \]

      15. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \left(D \cdot D\right)}{\color{blue}{\left(d \cdot d\right)} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      16. lower-*.f64 39.6

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \left(D \cdot D\right)}{\color{blue}{\left(d \cdot d\right)} \cdot \ell}, -0.125, w0\right) \]

   7. Applied rewrites 39.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \left(D \cdot D\right)}{\left(d \cdot d\right) \cdot \ell}, -0.125, w0\right)} \]

   8. Taylor expanded in M around inf

      \[\leadsto \frac{-1}{8} \cdot \color{blue}{\frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell}} \]
   9. Step-by-step derivation

   10. Applied rewrites 39.6%

       \[\leadsto \frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \left(D \cdot D\right)}{\left(d \cdot d\right) \cdot \ell} \cdot \color{blue}{-0.125} \]
   11. Step-by-step derivation

   12. Applied rewrites 39.3%

       \[\leadsto \left(\left(\left(M \cdot M\right) \cdot h\right) \cdot \frac{\left(D \cdot D\right) \cdot w0}{\left(d \cdot d\right) \cdot \ell}\right) \cdot -0.125 \]

   if -2.00000000000000019e199 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))

   1. Initial program 91.6%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 92.7%

      \[\leadsto w0 \cdot \color{blue}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 13: 77.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ w0\_m = \left|w0\right| \\ w0\_s = \mathsf{copysign}\left(1, w0\right) \\ [w0_m, M_m, D_m, h, l, d] = \mathsf{sort}([w0_m, M_m, D_m, h, l, d])\\ \\ w0\_s \cdot \begin{array}{l} \mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -2 \cdot 10^{+199}:\\ \;\;\;\;\left(\left(D\_m \cdot D\_m\right) \cdot \frac{\left(\left(M\_m \cdot M\_m\right) \cdot h\right) \cdot w0\_m}{\left(d \cdot d\right) \cdot \ell}\right) \cdot -0.125\\ \mathbf{else}:\\ \;\;\;\;w0\_m \cdot 1\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
w0\_m = (fabs.f64 w0)
w0\_s = (copysign.f64 #s(literal 1 binary64) w0)
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0_s w0_m M_m D_m h l d)
 :precision binary64
 (*
  w0_s
  (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -2e+199)
    (* (* (* D_m D_m) (/ (* (* (* M_m M_m) h) w0_m) (* (* d d) l))) -0.125)
    (* w0_m 1.0))))

C

D_m = fabs(D);
M_m = fabs(M);
w0\_m = fabs(w0);
w0\_s = copysign(1.0, w0);
assert(w0_m < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0_s, double w0_m, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -2e+199) {
		tmp = ((D_m * D_m) * ((((M_m * M_m) * h) * w0_m) / ((d * d) * l))) * -0.125;
	} else {
		tmp = w0_m * 1.0;
	}
	return w0_s * tmp;
}

Fortran

D_m =     private
M_m =     private
w0\_m =     private
w0\_s =     private
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
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(w0_s, w0_m, m_m, d_m, h, l, d)
use fmin_fmax_functions
    real(8), intent (in) :: w0_s
    real(8), intent (in) :: w0_m
    real(8), intent (in) :: m_m
    real(8), intent (in) :: d_m
    real(8), intent (in) :: h
    real(8), intent (in) :: l
    real(8), intent (in) :: d
    real(8) :: tmp
    if (((((m_m * d_m) / (2.0d0 * d)) ** 2.0d0) * (h / l)) <= (-2d+199)) then
        tmp = ((d_m * d_m) * ((((m_m * m_m) * h) * w0_m) / ((d * d) * l))) * (-0.125d0)
    else
        tmp = w0_m * 1.0d0
    end if
    code = w0_s * tmp
end function

Java

D_m = Math.abs(D);
M_m = Math.abs(M);
w0\_m = Math.abs(w0);
w0\_s = Math.copySign(1.0, w0);
assert w0_m < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0_s, double w0_m, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((Math.pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -2e+199) {
		tmp = ((D_m * D_m) * ((((M_m * M_m) * h) * w0_m) / ((d * d) * l))) * -0.125;
	} else {
		tmp = w0_m * 1.0;
	}
	return w0_s * tmp;
}

Python

D_m = math.fabs(D)
M_m = math.fabs(M)
w0\_m = math.fabs(w0)
w0\_s = math.copysign(1.0, w0)
[w0_m, M_m, D_m, h, l, d] = sort([w0_m, M_m, D_m, h, l, d])
def code(w0_s, w0_m, M_m, D_m, h, l, d):
	tmp = 0
	if (math.pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -2e+199:
		tmp = ((D_m * D_m) * ((((M_m * M_m) * h) * w0_m) / ((d * d) * l))) * -0.125
	else:
		tmp = w0_m * 1.0
	return w0_s * tmp

Julia

D_m = abs(D)
M_m = abs(M)
w0\_m = abs(w0)
w0\_s = copysign(1.0, w0)
w0_m, M_m, D_m, h, l, d = sort([w0_m, M_m, D_m, h, l, d])
function code(w0_s, w0_m, M_m, D_m, h, l, d)
	tmp = 0.0
	if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -2e+199)
		tmp = Float64(Float64(Float64(D_m * D_m) * Float64(Float64(Float64(Float64(M_m * M_m) * h) * w0_m) / Float64(Float64(d * d) * l))) * -0.125);
	else
		tmp = Float64(w0_m * 1.0);
	end
	return Float64(w0_s * tmp)
end

MATLAB

D_m = abs(D);
M_m = abs(M);
w0\_m = abs(w0);
w0\_s = sign(w0) * abs(1.0);
w0_m, M_m, D_m, h, l, d = num2cell(sort([w0_m, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0_s, w0_m, M_m, D_m, h, l, d)
	tmp = 0.0;
	if (((((M_m * D_m) / (2.0 * d)) ^ 2.0) * (h / l)) <= -2e+199)
		tmp = ((D_m * D_m) * ((((M_m * M_m) * h) * w0_m) / ((d * d) * l))) * -0.125;
	else
		tmp = w0_m * 1.0;
	end
	tmp_2 = w0_s * tmp;
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
w0\_m = N[Abs[w0], $MachinePrecision]
w0\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[w0]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0$95$s_, w0$95$m_, M$95$m_, D$95$m_, h_, l_, d_] := N[(w0$95$s * If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -2e+199], N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * h), $MachinePrecision] * w0$95$m), $MachinePrecision] / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * -0.125), $MachinePrecision], N[(w0$95$m * 1.0), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -2.00000000000000019e199

   1. Initial program 57.4%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}} \]

      2. *-commutative N/A

         \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{\frac{h}{\ell} \cdot {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}}} \]

      3. lift-pow.f64 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{h}{\ell} \cdot \color{blue}{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}}} \]

      4. unpow2 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{h}{\ell} \cdot \color{blue}{\left(\frac{M \cdot D}{2 \cdot d} \cdot \frac{M \cdot D}{2 \cdot d}\right)}} \]

      5. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \frac{M \cdot D}{2 \cdot d}}} \]

      6. lift-/.f64 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \color{blue}{\frac{M \cdot D}{2 \cdot d}}} \]

      7. frac-2neg N/A

         \[\leadsto w0 \cdot \sqrt{1 - \left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \color{blue}{\frac{\mathsf{neg}\left(M \cdot D\right)}{\mathsf{neg}\left(2 \cdot d\right)}}} \]

      8. associate-*r/ N/A

         \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{\frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\mathsf{neg}\left(2 \cdot d\right)}}} \]

      9. lift-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\mathsf{neg}\left(\color{blue}{2 \cdot d}\right)}} \]

      10. count-2-rev N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\mathsf{neg}\left(\color{blue}{\left(d + d\right)}\right)}} \]

      11. flip-+ N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\mathsf{neg}\left(\color{blue}{\frac{d \cdot d - d \cdot d}{d - d}}\right)}} \]

      12. distribute-neg-frac N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\color{blue}{\frac{\mathsf{neg}\left(\left(d \cdot d - d \cdot d\right)\right)}{d - d}}}} \]

      13. +-inverses N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\frac{\mathsf{neg}\left(\color{blue}{0}\right)}{d - d}}} \]

      14. metadata-eval N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\frac{\color{blue}{0}}{d - d}}} \]

      15. +-inverses N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\frac{\color{blue}{d \cdot d - d \cdot d}}{d - d}}} \]

      16. flip-+ N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\color{blue}{d + d}}} \]

      17. count-2-rev N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\color{blue}{2 \cdot d}}} \]

      18. lift-*.f64 N/A

          \[\leadsto w0 \cdot \sqrt{1 - \frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{\color{blue}{2 \cdot d}}} \]

      19. lower-/.f64 N/A

          \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{\frac{\left(\frac{h}{\ell} \cdot \frac{M \cdot D}{2 \cdot d}\right) \cdot \left(\mathsf{neg}\left(M \cdot D\right)\right)}{2 \cdot d}}} \]

   4. Applied rewrites 59.7%

      \[\leadsto w0 \cdot \sqrt{1 - \color{blue}{\frac{\left(\left(\frac{h}{\ell} \cdot D\right) \cdot \frac{\frac{M}{d}}{2}\right) \cdot \left(\left(-M\right) \cdot D\right)}{-2 \cdot d}}} \]

   5. Taylor expanded in M around 0

      \[\leadsto \color{blue}{w0 + \frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell}} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell} + w0} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell} \cdot \frac{-1}{8}} + w0 \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right)} \]

      4. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell}}, \frac{-1}{8}, w0\right) \]

      5. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\frac{\color{blue}{\left({M}^{2} \cdot \left(h \cdot w0\right)\right) \cdot {D}^{2}}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{\color{blue}{\left({M}^{2} \cdot \left(h \cdot w0\right)\right) \cdot {D}^{2}}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      7. associate-*r* N/A

         \[\leadsto \mathsf{fma}\left(\frac{\color{blue}{\left(\left({M}^{2} \cdot h\right) \cdot w0\right)} \cdot {D}^{2}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{\color{blue}{\left(\left({M}^{2} \cdot h\right) \cdot w0\right)} \cdot {D}^{2}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      9. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{\left(\color{blue}{\left({M}^{2} \cdot h\right)} \cdot w0\right) \cdot {D}^{2}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      10. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\color{blue}{\left(M \cdot M\right)} \cdot h\right) \cdot w0\right) \cdot {D}^{2}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      11. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\color{blue}{\left(M \cdot M\right)} \cdot h\right) \cdot w0\right) \cdot {D}^{2}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      12. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \color{blue}{\left(D \cdot D\right)}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      13. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \color{blue}{\left(D \cdot D\right)}}{{d}^{2} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      14. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \left(D \cdot D\right)}{\color{blue}{{d}^{2} \cdot \ell}}, \frac{-1}{8}, w0\right) \]

      15. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \left(D \cdot D\right)}{\color{blue}{\left(d \cdot d\right)} \cdot \ell}, \frac{-1}{8}, w0\right) \]

      16. lower-*.f64 39.6

          \[\leadsto \mathsf{fma}\left(\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \left(D \cdot D\right)}{\color{blue}{\left(d \cdot d\right)} \cdot \ell}, -0.125, w0\right) \]

   7. Applied rewrites 39.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \left(D \cdot D\right)}{\left(d \cdot d\right) \cdot \ell}, -0.125, w0\right)} \]

   8. Taylor expanded in M around inf

      \[\leadsto \frac{-1}{8} \cdot \color{blue}{\frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell}} \]
   9. Step-by-step derivation

   10. Applied rewrites 39.6%

       \[\leadsto \frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot w0\right) \cdot \left(D \cdot D\right)}{\left(d \cdot d\right) \cdot \ell} \cdot \color{blue}{-0.125} \]
   11. Step-by-step derivation

   12. Applied rewrites 39.6%

       \[\leadsto \left(\left(D \cdot D\right) \cdot \frac{\left(\left(M \cdot M\right) \cdot h\right) \cdot w0}{\left(d \cdot d\right) \cdot \ell}\right) \cdot -0.125 \]

   if -2.00000000000000019e199 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))

   1. Initial program 91.6%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 92.7%

      \[\leadsto w0 \cdot \color{blue}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 14: 83.5% accurate, 2.1× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ w0\_m = \left|w0\right| \\ w0\_s = \mathsf{copysign}\left(1, w0\right) \\ [w0_m, M_m, D_m, h, l, d] = \mathsf{sort}([w0_m, M_m, D_m, h, l, d])\\ \\ w0\_s \cdot \left(w0\_m \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\frac{D\_m}{d} \cdot \left(\frac{M\_m}{d} \cdot M\_m\right)\right) \cdot D\_m}{\ell}, 1\right)}\right) \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
w0\_m = (fabs.f64 w0)
w0\_s = (copysign.f64 #s(literal 1 binary64) w0)
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0_s w0_m M_m D_m h l d)
 :precision binary64
 (*
  w0_s
  (*
   w0_m
   (sqrt
    (fma (* h -0.25) (/ (* (* (/ D_m d) (* (/ M_m d) M_m)) D_m) l) 1.0)))))

C

D_m = fabs(D);
M_m = fabs(M);
w0\_m = fabs(w0);
w0\_s = copysign(1.0, w0);
assert(w0_m < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0_s, double w0_m, double M_m, double D_m, double h, double l, double d) {
	return w0_s * (w0_m * sqrt(fma((h * -0.25), ((((D_m / d) * ((M_m / d) * M_m)) * D_m) / l), 1.0)));
}

Julia

D_m = abs(D)
M_m = abs(M)
w0\_m = abs(w0)
w0\_s = copysign(1.0, w0)
w0_m, M_m, D_m, h, l, d = sort([w0_m, M_m, D_m, h, l, d])
function code(w0_s, w0_m, M_m, D_m, h, l, d)
	return Float64(w0_s * Float64(w0_m * sqrt(fma(Float64(h * -0.25), Float64(Float64(Float64(Float64(D_m / d) * Float64(Float64(M_m / d) * M_m)) * D_m) / l), 1.0))))
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
w0\_m = N[Abs[w0], $MachinePrecision]
w0\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[w0]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0$95$s_, w0$95$m_, M$95$m_, D$95$m_, h_, l_, d_] := N[(w0$95$s * N[(w0$95$m * N[Sqrt[N[(N[(h * -0.25), $MachinePrecision] * N[(N[(N[(N[(D$95$m / d), $MachinePrecision] * N[(N[(M$95$m / d), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] / l), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 81.5%

   \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
2. Add Preprocessing

3. Taylor expanded in h around inf

   \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{1}{h} - \frac{1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)}} \]
4. Step-by-step derivation

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

      \[\leadsto w0 \cdot \sqrt{h \cdot \color{blue}{\left(\frac{1}{h} + \left(\mathsf{neg}\left(\frac{1}{4}\right)\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)}} \]

   2. metadata-eval N/A

      \[\leadsto w0 \cdot \sqrt{h \cdot \left(\frac{1}{h} + \color{blue}{\frac{-1}{4}} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)} \]

   3. +-commutative N/A

      \[\leadsto w0 \cdot \sqrt{h \cdot \color{blue}{\left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \frac{1}{h}\right)}} \]

   4. distribute-lft-in N/A

      \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right) + h \cdot \frac{1}{h}}} \]

   5. associate-*r* N/A

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}} + h \cdot \frac{1}{h}} \]

   6. rgt-mult-inverse N/A

      \[\leadsto w0 \cdot \sqrt{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \color{blue}{1}} \]

   7. lower-fma.f64 N/A

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot \frac{-1}{4}, \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}, 1\right)}} \]

5. Applied rewrites 61.5%

   \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\left(M \cdot M\right) \cdot D\right) \cdot D}{\left(d \cdot d\right) \cdot \ell}, 1\right)}} \]
6. Step-by-step derivation

7. Applied rewrites 80.8%

   \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\frac{D}{d} \cdot \left(\frac{M}{d} \cdot M\right)\right) \cdot D}{\color{blue}{\ell}}, 1\right)} \]
8. Add Preprocessing

Alternative 15: 68.2% accurate, 26.2× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ w0\_m = \left|w0\right| \\ w0\_s = \mathsf{copysign}\left(1, w0\right) \\ [w0_m, M_m, D_m, h, l, d] = \mathsf{sort}([w0_m, M_m, D_m, h, l, d])\\ \\ w0\_s \cdot \left(w0\_m \cdot 1\right) \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
w0\_m = (fabs.f64 w0)
w0\_s = (copysign.f64 #s(literal 1 binary64) w0)
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0_s w0_m M_m D_m h l d) :precision binary64 (* w0_s (* w0_m 1.0)))

C

D_m = fabs(D);
M_m = fabs(M);
w0\_m = fabs(w0);
w0\_s = copysign(1.0, w0);
assert(w0_m < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0_s, double w0_m, double M_m, double D_m, double h, double l, double d) {
	return w0_s * (w0_m * 1.0);
}

Fortran

D_m =     private
M_m =     private
w0\_m =     private
w0\_s =     private
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
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(w0_s, w0_m, m_m, d_m, h, l, d)
use fmin_fmax_functions
    real(8), intent (in) :: w0_s
    real(8), intent (in) :: w0_m
    real(8), intent (in) :: m_m
    real(8), intent (in) :: d_m
    real(8), intent (in) :: h
    real(8), intent (in) :: l
    real(8), intent (in) :: d
    code = w0_s * (w0_m * 1.0d0)
end function

Java

D_m = Math.abs(D);
M_m = Math.abs(M);
w0\_m = Math.abs(w0);
w0\_s = Math.copySign(1.0, w0);
assert w0_m < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0_s, double w0_m, double M_m, double D_m, double h, double l, double d) {
	return w0_s * (w0_m * 1.0);
}

Python

D_m = math.fabs(D)
M_m = math.fabs(M)
w0\_m = math.fabs(w0)
w0\_s = math.copysign(1.0, w0)
[w0_m, M_m, D_m, h, l, d] = sort([w0_m, M_m, D_m, h, l, d])
def code(w0_s, w0_m, M_m, D_m, h, l, d):
	return w0_s * (w0_m * 1.0)

Julia

D_m = abs(D)
M_m = abs(M)
w0\_m = abs(w0)
w0\_s = copysign(1.0, w0)
w0_m, M_m, D_m, h, l, d = sort([w0_m, M_m, D_m, h, l, d])
function code(w0_s, w0_m, M_m, D_m, h, l, d)
	return Float64(w0_s * Float64(w0_m * 1.0))
end

MATLAB

D_m = abs(D);
M_m = abs(M);
w0\_m = abs(w0);
w0\_s = sign(w0) * abs(1.0);
w0_m, M_m, D_m, h, l, d = num2cell(sort([w0_m, M_m, D_m, h, l, d])){:}
function tmp = code(w0_s, w0_m, M_m, D_m, h, l, d)
	tmp = w0_s * (w0_m * 1.0);
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
w0\_m = N[Abs[w0], $MachinePrecision]
w0\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[w0]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: w0_m, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0$95$s_, w0$95$m_, M$95$m_, D$95$m_, h_, l_, d_] := N[(w0$95$s * N[(w0$95$m * 1.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 81.5%

   \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
2. Add Preprocessing

3. Taylor expanded in M around 0

   \[\leadsto w0 \cdot \color{blue}{1} \]
4. Step-by-step derivation

5. Applied rewrites 66.6%

   \[\leadsto w0 \cdot \color{blue}{1} \]
6. Add Preprocessing

Reproduce

herbie shell --seed 2024360 
(FPCore (w0 M D h l d)
  :name "Henrywood and Agarwal, Equation (9a)"
  :precision binary64
  (* w0 (sqrt (- 1.0 (* (pow (/ (* M D) (* 2.0 d)) 2.0) (/ h l))))))