Henrywood and Agarwal, Equation (9a)

Percentage Accurate: 80.5% → 89.7%

Time: 11.4s

Alternatives: 14

Speedup: 2.0×

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

real(8) function code(w0, m, d, h, l, d_1)
    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: 80.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

real(8) function code(w0, m, d, h, l, d_1)
    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: 89.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ \begin{array}{l} t_0 := \left(\frac{0.5}{d} \cdot M\_m\right) \cdot D\_m\\ w0 \cdot \sqrt{1 - \frac{t\_0}{\ell} \cdot \frac{t\_0}{{h}^{-1}}} \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (let* ((t_0 (* (* (/ 0.5 d) M_m) D_m)))
   (* w0 (sqrt (- 1.0 (* (/ t_0 l) (/ t_0 (pow h -1.0))))))))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
	double t_0 = ((0.5 / d) * M_m) * D_m;
	return w0 * sqrt((1.0 - ((t_0 / l) * (t_0 / pow(h, -1.0)))));
}

Fortran

D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
    real(8), intent (in) :: w0
    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) :: t_0
    t_0 = ((0.5d0 / d) * m_m) * d_m
    code = w0 * sqrt((1.0d0 - ((t_0 / l) * (t_0 / (h ** (-1.0d0))))))
end function

Java

D_m = Math.abs(D);
M_m = Math.abs(M);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
	double t_0 = ((0.5 / d) * M_m) * D_m;
	return w0 * Math.sqrt((1.0 - ((t_0 / l) * (t_0 / Math.pow(h, -1.0)))));
}

Python

D_m = math.fabs(D)
M_m = math.fabs(M)
[w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d])
def code(w0, M_m, D_m, h, l, d):
	t_0 = ((0.5 / d) * M_m) * D_m
	return w0 * math.sqrt((1.0 - ((t_0 / l) * (t_0 / math.pow(h, -1.0)))))

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, M_m, D_m, h, l, d)
	t_0 = Float64(Float64(Float64(0.5 / d) * M_m) * D_m)
	return Float64(w0 * sqrt(Float64(1.0 - Float64(Float64(t_0 / l) * Float64(t_0 / (h ^ -1.0))))))
end

MATLAB

D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp = code(w0, M_m, D_m, h, l, d)
	t_0 = ((0.5 / d) * M_m) * D_m;
	tmp = w0 * sqrt((1.0 - ((t_0 / l) * (t_0 / (h ^ -1.0)))));
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := Block[{t$95$0 = N[(N[(N[(0.5 / d), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision]}, N[(w0 * N[Sqrt[N[(1.0 - N[(N[(t$95$0 / l), $MachinePrecision] * N[(t$95$0 / N[Power[h, -1.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Initial program 81.6%

   \[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. lift-/.f64 N/A

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

   3. clear-num N/A

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

   4. un-div-inv N/A

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

   5. lift-pow.f64 N/A

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

   6. unpow2 N/A

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

   7. div-inv N/A

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

   8. times-frac N/A

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

   9. lower-*.f64 N/A

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

4. Applied rewrites 92.1%

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

Alternative 2: 86.5% accurate, 0.7× speedup

Math

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

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (if (<= (- 1.0 (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l))) 2.0)
   (* w0 1.0)
   (*
    w0
    (sqrt
     (fma
      (* h (/ (* -0.5 (* D_m M_m)) (* l d)))
      (* (* (/ 0.5 d) M_m) D_m)
      1.0)))))

C

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

Julia

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

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[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], 2.0], N[(w0 * 1.0), $MachinePrecision], N[(w0 * N[Sqrt[N[(N[(h * N[(N[(-0.5 * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / N[(l * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(0.5 / d), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.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 99.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 100.0%

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

   if 2 < (-.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 52.9%

      \[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{\color{blue}{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}} \]

      2. sub-neg N/A

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

      3. +-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

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

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

      7. lift-pow.f64 N/A

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

      8. unpow2 N/A

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

      9. distribute-lft-neg-in N/A

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

      10. associate-*r* N/A

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

      11. lower-fma.f64 N/A

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

   4. Applied rewrites 58.4%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. frac-times N/A

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

      5. associate-/l* N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-/.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. *-commutative N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lift-*.f64 N/A

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

      16. *-commutative N/A

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

      17. lower-*.f64 74.4

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

   6. Applied rewrites 74.4%

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

Alternative 3: 85.0% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[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], 2.0], N[(w0 * 1.0), $MachinePrecision], N[(w0 * N[Sqrt[N[(N[(N[(-0.25 * h), $MachinePrecision] * N[(M$95$m * D$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(M$95$m / d), $MachinePrecision] * N[(D$95$m / N[(d * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.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 99.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 100.0%

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

   if 2 < (-.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 52.9%

      \[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 \sqrt{\color{blue}{1 + \frac{-1}{4} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell}}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. associate-*r/ N/A

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

      3. associate-*r* N/A

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

      4. associate-*r* N/A

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

      5. associate-*l/ N/A

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

      6. associate-*r/ N/A

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

      7. lft-mult-inverse N/A

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

      8. distribute-rgt-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} + \frac{1}{h}\right)}} \]

      9. 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}}} \]

      10. 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}} \]

      11. 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}} \]

      12. 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 52.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 57.7%

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

   9. Applied rewrites 72.5%

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

Alternative 4: 83.6% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[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], 2.0], N[(w0 * 1.0), $MachinePrecision], N[(w0 * N[Sqrt[N[(N[(h * -0.25), $MachinePrecision] * N[(N[(N[(M$95$m / d), $MachinePrecision] * N[(N[(D$95$m * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision]), $MachinePrecision] / N[(l * d), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.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 99.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 100.0%

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

   if 2 < (-.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 52.9%

      \[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 \sqrt{\color{blue}{1 + \frac{-1}{4} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell}}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. associate-*r/ N/A

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

      3. associate-*r* N/A

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

      4. associate-*r* N/A

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

      5. associate-*l/ N/A

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

      6. associate-*r/ N/A

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

      7. lft-mult-inverse N/A

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

      8. distribute-rgt-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} + \frac{1}{h}\right)}} \]

      9. 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}}} \]

      10. 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}} \]

      11. 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}} \]

      12. 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 52.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 57.7%

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

   9. Applied rewrites 66.7%

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

   11. Applied rewrites 69.4%

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

Alternative 5: 82.6% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[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], 2.0], N[(w0 * 1.0), $MachinePrecision], N[(w0 * N[Sqrt[N[(N[(h * -0.25), $MachinePrecision] * N[(N[(N[(D$95$m * M$95$m), $MachinePrecision] * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / N[(N[(d * l), $MachinePrecision] * d), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.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 99.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 100.0%

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

   if 2 < (-.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 52.9%

      \[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 \sqrt{\color{blue}{1 + \frac{-1}{4} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell}}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. associate-*r/ N/A

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

      3. associate-*r* N/A

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

      4. associate-*r* N/A

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

      5. associate-*l/ N/A

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

      6. associate-*r/ N/A

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

      7. lft-mult-inverse N/A

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

      8. distribute-rgt-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} + \frac{1}{h}\right)}} \]

      9. 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}}} \]

      10. 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}} \]

      11. 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}} \]

      12. 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 52.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 57.7%

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

   9. Applied rewrites 68.0%

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

Alternative 6: 81.3% accurate, 0.8× speedup

Math

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

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -5e+27)
   (*
    w0
    (sqrt (fma (* h -0.25) (* M_m (* (* D_m M_m) (/ D_m (* (* d d) l)))) 1.0)))
   (* w0 1.0)))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, 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)) <= -5e+27) {
		tmp = w0 * sqrt(fma((h * -0.25), (M_m * ((D_m * M_m) * (D_m / ((d * d) * l)))), 1.0));
	} else {
		tmp = w0 * 1.0;
	}
	return tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, 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)) <= -5e+27)
		tmp = Float64(w0 * sqrt(fma(Float64(h * -0.25), Float64(M_m * Float64(Float64(D_m * M_m) * Float64(D_m / Float64(Float64(d * d) * l)))), 1.0)));
	else
		tmp = Float64(w0 * 1.0);
	end
	return tmp
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := 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], -5e+27], N[(w0 * N[Sqrt[N[(N[(h * -0.25), $MachinePrecision] * N[(M$95$m * N[(N[(D$95$m * M$95$m), $MachinePrecision] * N[(D$95$m / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * 1.0), $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)) < -4.99999999999999979e27

   1. Initial program 73.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 \sqrt{\color{blue}{1 + \frac{-1}{4} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell}}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. associate-*r/ N/A

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

      3. associate-*r* N/A

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

      4. associate-*r* N/A

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

      5. associate-*l/ N/A

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

      6. associate-*r/ N/A

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

      7. lft-mult-inverse N/A

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

      8. distribute-rgt-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} + \frac{1}{h}\right)}} \]

      9. 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}}} \]

      10. 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}} \]

      11. 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}} \]

      12. 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 50.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 59.5%

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

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

   1. Initial program 84.9%

      \[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.0%

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

Alternative 7: 78.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ \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^{+141}:\\ \;\;\;\;w0 \cdot \mathsf{fma}\left(\left(D\_m \cdot D\_m\right) \cdot -0.125, \frac{M\_m}{d \cdot d} \cdot \frac{h \cdot M\_m}{\ell}, 1\right)\\ \mathbf{else}:\\ \;\;\;\;w0 \cdot 1\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -2e+141)
   (* w0 (fma (* (* D_m D_m) -0.125) (* (/ M_m (* d d)) (/ (* h M_m) l)) 1.0))
   (* w0 1.0)))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, 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+141) {
		tmp = w0 * fma(((D_m * D_m) * -0.125), ((M_m / (d * d)) * ((h * M_m) / l)), 1.0);
	} else {
		tmp = w0 * 1.0;
	}
	return tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, 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+141)
		tmp = Float64(w0 * fma(Float64(Float64(D_m * D_m) * -0.125), Float64(Float64(M_m / Float64(d * d)) * Float64(Float64(h * M_m) / l)), 1.0));
	else
		tmp = Float64(w0 * 1.0);
	end
	return tmp
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := 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+141], N[(w0 * N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * -0.125), $MachinePrecision] * N[(N[(M$95$m / N[(d * d), $MachinePrecision]), $MachinePrecision] * N[(N[(h * M$95$m), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(w0 * 1.0), $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.00000000000000003e141

   1. Initial program 71.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}{\left(1 + \frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell}\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. lower-fma.f64 N/A

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

   5. Applied rewrites 48.7%

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

   7. Applied rewrites 58.1%

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

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

   1. Initial program 85.2%

      \[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 8: 79.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ \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^{+141}:\\ \;\;\;\;w0 \cdot \mathsf{fma}\left(\left(D\_m \cdot D\_m\right) \cdot -0.125, \frac{M\_m}{d} \cdot \frac{h \cdot M\_m}{\ell \cdot d}, 1\right)\\ \mathbf{else}:\\ \;\;\;\;w0 \cdot 1\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -2e+141)
   (* w0 (fma (* (* D_m D_m) -0.125) (* (/ M_m d) (/ (* h M_m) (* l d))) 1.0))
   (* w0 1.0)))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, 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+141) {
		tmp = w0 * fma(((D_m * D_m) * -0.125), ((M_m / d) * ((h * M_m) / (l * d))), 1.0);
	} else {
		tmp = w0 * 1.0;
	}
	return tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, 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+141)
		tmp = Float64(w0 * fma(Float64(Float64(D_m * D_m) * -0.125), Float64(Float64(M_m / d) * Float64(Float64(h * M_m) / Float64(l * d))), 1.0));
	else
		tmp = Float64(w0 * 1.0);
	end
	return tmp
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := 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+141], N[(w0 * N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * -0.125), $MachinePrecision] * N[(N[(M$95$m / d), $MachinePrecision] * N[(N[(h * M$95$m), $MachinePrecision] / N[(l * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(w0 * 1.0), $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.00000000000000003e141

   1. Initial program 71.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}{\left(1 + \frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell}\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. lower-fma.f64 N/A

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

   5. Applied rewrites 48.7%

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

   7. Applied rewrites 58.2%

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

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

   1. Initial program 85.2%

      \[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: 78.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ \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^{+141}:\\ \;\;\;\;w0 \cdot \mathsf{fma}\left(\left(D\_m \cdot D\_m\right) \cdot -0.125, M\_m \cdot \frac{h \cdot M\_m}{\left(d \cdot d\right) \cdot \ell}, 1\right)\\ \mathbf{else}:\\ \;\;\;\;w0 \cdot 1\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -2e+141)
   (* w0 (fma (* (* D_m D_m) -0.125) (* M_m (/ (* h M_m) (* (* d d) l))) 1.0))
   (* w0 1.0)))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, 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+141) {
		tmp = w0 * fma(((D_m * D_m) * -0.125), (M_m * ((h * M_m) / ((d * d) * l))), 1.0);
	} else {
		tmp = w0 * 1.0;
	}
	return tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, 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+141)
		tmp = Float64(w0 * fma(Float64(Float64(D_m * D_m) * -0.125), Float64(M_m * Float64(Float64(h * M_m) / Float64(Float64(d * d) * l))), 1.0));
	else
		tmp = Float64(w0 * 1.0);
	end
	return tmp
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := 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+141], N[(w0 * N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * -0.125), $MachinePrecision] * N[(M$95$m * N[(N[(h * M$95$m), $MachinePrecision] / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(w0 * 1.0), $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.00000000000000003e141

   1. Initial program 71.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}{\left(1 + \frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell}\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. lower-fma.f64 N/A

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

   5. Applied rewrites 48.7%

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

   7. Applied rewrites 55.0%

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

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

   1. Initial program 85.2%

      \[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 10: 77.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ \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^{+91}:\\ \;\;\;\;\mathsf{fma}\left(w0 \cdot -0.125, \frac{\left(\left(\left(M\_m \cdot M\_m\right) \cdot h\right) \cdot D\_m\right) \cdot D\_m}{\left(\ell \cdot d\right) \cdot d}, w0\right)\\ \mathbf{else}:\\ \;\;\;\;w0 \cdot 1\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -1e+91)
   (fma (* w0 -0.125) (/ (* (* (* (* M_m M_m) h) D_m) D_m) (* (* l d) d)) w0)
   (* w0 1.0)))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, 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+91) {
		tmp = fma((w0 * -0.125), (((((M_m * M_m) * h) * D_m) * D_m) / ((l * d) * d)), w0);
	} else {
		tmp = w0 * 1.0;
	}
	return tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, 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+91)
		tmp = fma(Float64(w0 * -0.125), Float64(Float64(Float64(Float64(Float64(M_m * M_m) * h) * D_m) * D_m) / Float64(Float64(l * d) * d)), w0);
	else
		tmp = Float64(w0 * 1.0);
	end
	return tmp
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := 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+91], N[(N[(w0 * -0.125), $MachinePrecision] * N[(N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * h), $MachinePrecision] * D$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] / N[(N[(l * d), $MachinePrecision] * d), $MachinePrecision]), $MachinePrecision] + w0), $MachinePrecision], N[(w0 * 1.0), $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.00000000000000008e91

   1. Initial program 72.3%

      \[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 \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}} \]
   4. 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. associate-/l* N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. lower-fma.f64 N/A

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

   5. Applied rewrites 48.9%

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

   6. Taylor expanded in w0 around 0

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

   8. Applied rewrites 50.8%

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

   10. Applied rewrites 52.5%

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

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

   1. Initial program 85.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 94.1%

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

Alternative 11: 77.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ \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^{+141}:\\ \;\;\;\;\mathsf{fma}\left(w0 \cdot -0.125, \frac{\left(\left(\left(M\_m \cdot M\_m\right) \cdot h\right) \cdot D\_m\right) \cdot D\_m}{\left(d \cdot d\right) \cdot \ell}, w0\right)\\ \mathbf{else}:\\ \;\;\;\;w0 \cdot 1\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -2e+141)
   (fma (* w0 -0.125) (/ (* (* (* (* M_m M_m) h) D_m) D_m) (* (* d d) l)) w0)
   (* w0 1.0)))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, 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+141) {
		tmp = fma((w0 * -0.125), (((((M_m * M_m) * h) * D_m) * D_m) / ((d * d) * l)), w0);
	} else {
		tmp = w0 * 1.0;
	}
	return tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, 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+141)
		tmp = fma(Float64(w0 * -0.125), Float64(Float64(Float64(Float64(Float64(M_m * M_m) * h) * D_m) * D_m) / Float64(Float64(d * d) * l)), w0);
	else
		tmp = Float64(w0 * 1.0);
	end
	return tmp
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := 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+141], N[(N[(w0 * -0.125), $MachinePrecision] * N[(N[(N[(N[(N[(M$95$m * M$95$m), $MachinePrecision] * h), $MachinePrecision] * D$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] + w0), $MachinePrecision], N[(w0 * 1.0), $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.00000000000000003e141

   1. Initial program 71.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 \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}} \]
   4. 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. associate-/l* N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. lower-fma.f64 N/A

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

   5. Applied rewrites 50.2%

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

   6. Taylor expanded in w0 around 0

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

   8. Applied rewrites 52.2%

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

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

   1. Initial program 85.2%

      \[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 12: 88.6% accurate, 1.9× speedup

Math

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

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (*
  w0
  (sqrt
   (fma
    (* (* (/ 0.5 d) M_m) D_m)
    (/ (* (* D_m 0.5) (* (/ M_m d) h)) (- l))
    1.0))))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
	return w0 * sqrt(fma((((0.5 / d) * M_m) * D_m), (((D_m * 0.5) * ((M_m / d) * h)) / -l), 1.0));
}

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, M_m, D_m, h, l, d)
	return Float64(w0 * sqrt(fma(Float64(Float64(Float64(0.5 / d) * M_m) * D_m), Float64(Float64(Float64(D_m * 0.5) * Float64(Float64(M_m / d) * h)) / Float64(-l)), 1.0)))
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := N[(w0 * N[Sqrt[N[(N[(N[(N[(0.5 / d), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(N[(N[(D$95$m * 0.5), $MachinePrecision] * N[(N[(M$95$m / d), $MachinePrecision] * h), $MachinePrecision]), $MachinePrecision] / (-l)), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 81.6%

   \[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{\color{blue}{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}} \]

   2. sub-neg N/A

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

   3. +-commutative N/A

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

   4. lift-*.f64 N/A

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

   5. lift-/.f64 N/A

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

   6. associate-*r/ N/A

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

   7. distribute-neg-frac2 N/A

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

   8. lift-pow.f64 N/A

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

   9. unpow2 N/A

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

   10. associate-*l* N/A

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

   11. associate-/l* N/A

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

   12. lower-fma.f64 N/A

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

4. Applied rewrites 91.4%

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

Alternative 13: 86.1% accurate, 2.0× speedup

Math

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

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (*
  w0
  (sqrt
   (fma
    (* (/ (/ (* (* h M_m) D_m) d) l) -0.5)
    (* (* (/ 0.5 d) M_m) D_m)
    1.0))))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
	return w0 * sqrt(fma((((((h * M_m) * D_m) / d) / l) * -0.5), (((0.5 / d) * M_m) * D_m), 1.0));
}

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, M_m, D_m, h, l, d)
	return Float64(w0 * sqrt(fma(Float64(Float64(Float64(Float64(Float64(h * M_m) * D_m) / d) / l) * -0.5), Float64(Float64(Float64(0.5 / d) * M_m) * D_m), 1.0)))
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := N[(w0 * N[Sqrt[N[(N[(N[(N[(N[(N[(h * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] / d), $MachinePrecision] / l), $MachinePrecision] * -0.5), $MachinePrecision] * N[(N[(N[(0.5 / d), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 81.6%

   \[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{\color{blue}{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}} \]

   2. sub-neg N/A

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

   3. +-commutative N/A

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

   4. lift-*.f64 N/A

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

   5. *-commutative N/A

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

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

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

   7. lift-pow.f64 N/A

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

   8. unpow2 N/A

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

   9. distribute-lft-neg-in N/A

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

   10. associate-*r* N/A

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

   11. lower-fma.f64 N/A

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

4. Applied rewrites 83.3%

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

5. Taylor expanded in M around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. associate-/r* N/A

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

   4. lower-/.f64 N/A

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

   5. lower-/.f64 N/A

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

   6. *-commutative N/A

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

   7. lower-*.f64 N/A

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

   8. *-commutative N/A

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

   9. lower-*.f64 89.6

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

7. Applied rewrites 89.6%

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

Alternative 14: 66.9% accurate, 26.2× speedup

Math

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

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d) :precision binary64 (* w0 1.0))

C

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

Fortran

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

Java

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

Python

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

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, M_m, D_m, h, l, d)
	return Float64(w0 * 1.0)
end

MATLAB

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

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := N[(w0 * 1.0), $MachinePrecision]

Derivation

1. Initial program 81.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 70.0%

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

Reproduce

herbie shell --seed 2024324 
(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))))))