Henrywood and Agarwal, Equation (9a)

Percentage Accurate: 80.3% → 86.1%

Time: 17.4s

Alternatives: 4

Speedup: 1.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.3% 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: 86.1% accurate, 1.0× speedup

Math

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

FPCore

M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
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 (- 1.0 (/ (* h (pow (* 0.5 (* D_m (/ M_m d))) 2.0)) l)))))

C

M_m = fabs(M);
D_m = fabs(D);
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((1.0 - ((h * pow((0.5 * (D_m * (M_m / d))), 2.0)) / l)));
}

Fortran

M_m = abs(m)
D_m = abs(d)
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 * sqrt((1.0d0 - ((h * ((0.5d0 * (d_m * (m_m / d))) ** 2.0d0)) / l)))
end function

Java

M_m = Math.abs(M);
D_m = Math.abs(D);
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 * Math.sqrt((1.0 - ((h * Math.pow((0.5 * (D_m * (M_m / d))), 2.0)) / l)));
}

Python

M_m = math.fabs(M)
D_m = math.fabs(D)
[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 * math.sqrt((1.0 - ((h * math.pow((0.5 * (D_m * (M_m / d))), 2.0)) / l)))

Julia

M_m = abs(M)
D_m = abs(D)
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(Float64(1.0 - Float64(Float64(h * (Float64(0.5 * Float64(D_m * Float64(M_m / d))) ^ 2.0)) / l))))
end

MATLAB

M_m = abs(M);
D_m = abs(D);
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 * sqrt((1.0 - ((h * ((0.5 * (D_m * (M_m / d))) ^ 2.0)) / l)));
end

Wolfram

M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $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[(1.0 - N[(N[(h * N[Power[N[(0.5 * N[(D$95$m * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 75.1%

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

3. Simplified 77.5%

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

   1. unpow2 77.5%

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

   2. unpow2 77.5%

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

   3. associate-/r* 77.5%

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

   4. associate-*r/ 75.1%

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

   5. *-commutative 75.1%

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

   6. associate-*r/ 81.6%

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

   7. *-commutative 81.6%

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

   8. associate-*l/ 84.4%

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

   9. associate-/r* 84.4%

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

   10. clear-num 84.4%

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

   11. associate-*l/ 84.4%

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

   12. *-un-lft-identity 84.4%

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

   13. associate-/r/ 84.4%

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

6. Applied egg-rr 84.4%

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

7. Taylor expanded in D around 0 81.6%

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

   1. associate-/l* 84.4%

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

9. Simplified 84.4%

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

Alternative 2: 86.1% accurate, 1.0× speedup

Math

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

FPCore

M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
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 (- 1.0 (* h (* 0.25 (/ (pow (/ D_m (/ d M_m)) 2.0) l)))))))

C

M_m = fabs(M);
D_m = fabs(D);
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((1.0 - (h * (0.25 * (pow((D_m / (d / M_m)), 2.0) / l)))));
}

Fortran

M_m = abs(m)
D_m = abs(d)
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 * sqrt((1.0d0 - (h * (0.25d0 * (((d_m / (d / m_m)) ** 2.0d0) / l)))))
end function

Java

M_m = Math.abs(M);
D_m = Math.abs(D);
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 * Math.sqrt((1.0 - (h * (0.25 * (Math.pow((D_m / (d / M_m)), 2.0) / l)))));
}

Python

M_m = math.fabs(M)
D_m = math.fabs(D)
[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 * math.sqrt((1.0 - (h * (0.25 * (math.pow((D_m / (d / M_m)), 2.0) / l)))))

Julia

M_m = abs(M)
D_m = abs(D)
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(Float64(1.0 - Float64(h * Float64(0.25 * Float64((Float64(D_m / Float64(d / M_m)) ^ 2.0) / l))))))
end

MATLAB

M_m = abs(M);
D_m = abs(D);
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 * sqrt((1.0 - (h * (0.25 * (((D_m / (d / M_m)) ^ 2.0) / l)))));
end

Wolfram

M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $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[(1.0 - N[(h * N[(0.25 * N[(N[Power[N[(D$95$m / N[(d / M$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 75.1%

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

3. Simplified 77.5%

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

   1. unpow2 77.5%

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

   2. unpow2 77.5%

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

   3. associate-/r* 77.5%

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

   4. associate-*r/ 75.1%

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

   5. *-commutative 75.1%

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

   6. associate-*r/ 81.6%

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

   7. *-commutative 81.6%

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

   8. associate-*l/ 84.4%

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

   9. associate-/r* 84.4%

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

   10. clear-num 84.4%

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

   11. associate-*l/ 84.4%

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

   12. *-un-lft-identity 84.4%

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

   13. associate-/r/ 84.4%

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

6. Applied egg-rr 84.4%

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

7. Taylor expanded in D around 0 81.6%

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

   1. associate-/l* 84.4%

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

9. Simplified 84.4%

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

    1. associate-/l* 84.4%

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

    2. unpow-prod-down 84.4%

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

    3. metadata-eval 84.4%

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

11. Applied egg-rr 84.4%

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

    1. associate-/l* 84.4%

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

    2. associate-*r/ 81.6%

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

    3. associate-*l/ 83.6%

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

    4. associate-/r/ 84.4%

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

13. Simplified 84.4%

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

Alternative 3: 69.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} M_m = \left|M\right| \\ D_m = \left|D\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ \begin{array}{l} \mathbf{if}\;M\_m \leq 5.4 \cdot 10^{+76}:\\ \;\;\;\;w0\\ \mathbf{else}:\\ \;\;\;\;\log \left(e^{w0}\right)\\ \end{array} \end{array} \]

FPCore

M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
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 (<= M_m 5.4e+76) w0 (log (exp w0))))

C

M_m = fabs(M);
D_m = fabs(D);
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 (M_m <= 5.4e+76) {
		tmp = w0;
	} else {
		tmp = log(exp(w0));
	}
	return tmp;
}

Fortran

M_m = abs(m)
D_m = abs(d)
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) :: tmp
    if (m_m <= 5.4d+76) then
        tmp = w0
    else
        tmp = log(exp(w0))
    end if
    code = tmp
end function

Java

M_m = Math.abs(M);
D_m = Math.abs(D);
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 tmp;
	if (M_m <= 5.4e+76) {
		tmp = w0;
	} else {
		tmp = Math.log(Math.exp(w0));
	}
	return tmp;
}

Python

M_m = math.fabs(M)
D_m = math.fabs(D)
[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):
	tmp = 0
	if M_m <= 5.4e+76:
		tmp = w0
	else:
		tmp = math.log(math.exp(w0))
	return tmp

Julia

M_m = abs(M)
D_m = abs(D)
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 (M_m <= 5.4e+76)
		tmp = w0;
	else
		tmp = log(exp(w0));
	end
	return tmp
end

MATLAB

M_m = abs(M);
D_m = abs(D);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
	tmp = 0.0;
	if (M_m <= 5.4e+76)
		tmp = w0;
	else
		tmp = log(exp(w0));
	end
	tmp_2 = tmp;
end

Wolfram

M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $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[M$95$m, 5.4e+76], w0, N[Log[N[Exp[w0], $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if M < 5.3999999999999998e76

   1. Initial program 77.1%

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

   3. Simplified 79.0%

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

   5. Taylor expanded in D around 0 71.0%

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

   if 5.3999999999999998e76 < M

   1. Initial program 63.6%

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

   3. Simplified 68.9%

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

      1. add-sqr-sqrt 34.1%

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

      2. sqrt-unprod 27.7%

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

      3. *-commutative 27.7%

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

      4. *-commutative 27.7%

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

      5. swap-sqr 27.7%

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

   6. Applied egg-rr 27.7%

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

   7. Taylor expanded in h around 0 26.1%

      \[\leadsto \sqrt{\color{blue}{{w0}^{2}}} \]
   8. Step-by-step derivation

      1. sqrt-pow1 50.1%

         \[\leadsto \color{blue}{{w0}^{\left(\frac{2}{2}\right)}} \]

      2. metadata-eval 50.1%

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

      3. pow1 50.1%

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

      4. add-log-exp 31.9%

         \[\leadsto \color{blue}{\log \left(e^{w0}\right)} \]

   9. Applied egg-rr 31.9%

      \[\leadsto \color{blue}{\log \left(e^{w0}\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 67.2% accurate, 216.0× speedup

Math

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

FPCore

M_m = (fabs.f64 M)
D_m = (fabs.f64 D)
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)

C

M_m = fabs(M);
D_m = fabs(D);
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;
}

Fortran

M_m = abs(m)
D_m = abs(d)
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
end function

Java

M_m = Math.abs(M);
D_m = Math.abs(D);
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;
}

Python

M_m = math.fabs(M)
D_m = math.fabs(D)
[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

Julia

M_m = abs(M)
D_m = abs(D)
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 w0
end

MATLAB

M_m = abs(M);
D_m = abs(D);
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;
end

Wolfram

M_m = N[Abs[M], $MachinePrecision]
D_m = N[Abs[D], $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_] := w0

Derivation

1. Initial program 75.1%

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

3. Simplified 77.5%

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

5. Taylor expanded in D around 0 67.9%

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

Reproduce

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