Henrywood and Agarwal, Equation (13)

Percentage Accurate: 24.7% → 36.9%

Time: 11.1s

Alternatives: 9

Speedup: 0.5×

Specification

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)}\\ \frac{c0}{2 \cdot w} \cdot \left(t\_0 + \sqrt{t\_0 \cdot t\_0 - M \cdot M}\right) \end{array} \end{array} \]

FPCore

(FPCore (c0 w h D d M)
 :precision binary64
 (let* ((t_0 (/ (* c0 (* d d)) (* (* w h) (* D D)))))
   (* (/ c0 (* 2.0 w)) (+ t_0 (sqrt (- (* t_0 t_0) (* M M)))))))

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	return (c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))));
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(c0, w, h, d, d_1, m)
use fmin_fmax_functions
    real(8), intent (in) :: c0
    real(8), intent (in) :: w
    real(8), intent (in) :: h
    real(8), intent (in) :: d
    real(8), intent (in) :: d_1
    real(8), intent (in) :: m
    real(8) :: t_0
    t_0 = (c0 * (d_1 * d_1)) / ((w * h) * (d * d))
    code = (c0 / (2.0d0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (m * m))))
end function

Java

public static double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	return (c0 / (2.0 * w)) * (t_0 + Math.sqrt(((t_0 * t_0) - (M * M))));
}

Python

def code(c0, w, h, D, d, M):
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D))
	return (c0 / (2.0 * w)) * (t_0 + math.sqrt(((t_0 * t_0) - (M * M))))

Julia

function code(c0, w, h, D, d, M)
	t_0 = Float64(Float64(c0 * Float64(d * d)) / Float64(Float64(w * h) * Float64(D * D)))
	return Float64(Float64(c0 / Float64(2.0 * w)) * Float64(t_0 + sqrt(Float64(Float64(t_0 * t_0) - Float64(M * M)))))
end

MATLAB

function tmp = code(c0, w, h, D, d, M)
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	tmp = (c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))));
end

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(N[(c0 * N[(d * d), $MachinePrecision]), $MachinePrecision] / N[(N[(w * h), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(N[(c0 / N[(2.0 * w), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 + N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Initial Program: 24.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)}\\ \frac{c0}{2 \cdot w} \cdot \left(t\_0 + \sqrt{t\_0 \cdot t\_0 - M \cdot M}\right) \end{array} \end{array} \]

FPCore

(FPCore (c0 w h D d M)
 :precision binary64
 (let* ((t_0 (/ (* c0 (* d d)) (* (* w h) (* D D)))))
   (* (/ c0 (* 2.0 w)) (+ t_0 (sqrt (- (* t_0 t_0) (* M M)))))))

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	return (c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))));
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(c0, w, h, d, d_1, m)
use fmin_fmax_functions
    real(8), intent (in) :: c0
    real(8), intent (in) :: w
    real(8), intent (in) :: h
    real(8), intent (in) :: d
    real(8), intent (in) :: d_1
    real(8), intent (in) :: m
    real(8) :: t_0
    t_0 = (c0 * (d_1 * d_1)) / ((w * h) * (d * d))
    code = (c0 / (2.0d0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (m * m))))
end function

Java

public static double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	return (c0 / (2.0 * w)) * (t_0 + Math.sqrt(((t_0 * t_0) - (M * M))));
}

Python

def code(c0, w, h, D, d, M):
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D))
	return (c0 / (2.0 * w)) * (t_0 + math.sqrt(((t_0 * t_0) - (M * M))))

Julia

function code(c0, w, h, D, d, M)
	t_0 = Float64(Float64(c0 * Float64(d * d)) / Float64(Float64(w * h) * Float64(D * D)))
	return Float64(Float64(c0 / Float64(2.0 * w)) * Float64(t_0 + sqrt(Float64(Float64(t_0 * t_0) - Float64(M * M)))))
end

MATLAB

function tmp = code(c0, w, h, D, d, M)
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	tmp = (c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))));
end

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(N[(c0 * N[(d * d), $MachinePrecision]), $MachinePrecision] / N[(N[(w * h), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(N[(c0 / N[(2.0 * w), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 + N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Alternative 1: 36.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(w \cdot h\right) \cdot \left(D \cdot D\right)\\ t_1 := \frac{\left(c0 \cdot d\right) \cdot d}{t\_0}\\ t_2 := \frac{c0}{2 \cdot w}\\ t_3 := \frac{c0 \cdot \left(d \cdot d\right)}{t\_0}\\ \mathbf{if}\;t\_2 \cdot \left(t\_3 + \sqrt{t\_3 \cdot t\_3 - M \cdot M}\right) \leq \infty:\\ \;\;\;\;t\_2 \cdot \left(t\_1 + \sqrt{t\_1 \cdot t\_1 - M \cdot M}\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{c0 \cdot \sqrt{-{M}^{2}}}{w}\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 w h D d M)
 :precision binary64
 (let* ((t_0 (* (* w h) (* D D)))
        (t_1 (/ (* (* c0 d) d) t_0))
        (t_2 (/ c0 (* 2.0 w)))
        (t_3 (/ (* c0 (* d d)) t_0)))
   (if (<= (* t_2 (+ t_3 (sqrt (- (* t_3 t_3) (* M M))))) INFINITY)
     (* t_2 (+ t_1 (sqrt (- (* t_1 t_1) (* M M)))))
     (* 0.5 (/ (* c0 (sqrt (- (pow M 2.0)))) w)))))

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (w * h) * (D * D);
	double t_1 = ((c0 * d) * d) / t_0;
	double t_2 = c0 / (2.0 * w);
	double t_3 = (c0 * (d * d)) / t_0;
	double tmp;
	if ((t_2 * (t_3 + sqrt(((t_3 * t_3) - (M * M))))) <= ((double) INFINITY)) {
		tmp = t_2 * (t_1 + sqrt(((t_1 * t_1) - (M * M))));
	} else {
		tmp = 0.5 * ((c0 * sqrt(-pow(M, 2.0))) / w);
	}
	return tmp;
}

Java

public static double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (w * h) * (D * D);
	double t_1 = ((c0 * d) * d) / t_0;
	double t_2 = c0 / (2.0 * w);
	double t_3 = (c0 * (d * d)) / t_0;
	double tmp;
	if ((t_2 * (t_3 + Math.sqrt(((t_3 * t_3) - (M * M))))) <= Double.POSITIVE_INFINITY) {
		tmp = t_2 * (t_1 + Math.sqrt(((t_1 * t_1) - (M * M))));
	} else {
		tmp = 0.5 * ((c0 * Math.sqrt(-Math.pow(M, 2.0))) / w);
	}
	return tmp;
}

Python

def code(c0, w, h, D, d, M):
	t_0 = (w * h) * (D * D)
	t_1 = ((c0 * d) * d) / t_0
	t_2 = c0 / (2.0 * w)
	t_3 = (c0 * (d * d)) / t_0
	tmp = 0
	if (t_2 * (t_3 + math.sqrt(((t_3 * t_3) - (M * M))))) <= math.inf:
		tmp = t_2 * (t_1 + math.sqrt(((t_1 * t_1) - (M * M))))
	else:
		tmp = 0.5 * ((c0 * math.sqrt(-math.pow(M, 2.0))) / w)
	return tmp

Julia

function code(c0, w, h, D, d, M)
	t_0 = Float64(Float64(w * h) * Float64(D * D))
	t_1 = Float64(Float64(Float64(c0 * d) * d) / t_0)
	t_2 = Float64(c0 / Float64(2.0 * w))
	t_3 = Float64(Float64(c0 * Float64(d * d)) / t_0)
	tmp = 0.0
	if (Float64(t_2 * Float64(t_3 + sqrt(Float64(Float64(t_3 * t_3) - Float64(M * M))))) <= Inf)
		tmp = Float64(t_2 * Float64(t_1 + sqrt(Float64(Float64(t_1 * t_1) - Float64(M * M)))));
	else
		tmp = Float64(0.5 * Float64(Float64(c0 * sqrt(Float64(-(M ^ 2.0)))) / w));
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, w, h, D, d, M)
	t_0 = (w * h) * (D * D);
	t_1 = ((c0 * d) * d) / t_0;
	t_2 = c0 / (2.0 * w);
	t_3 = (c0 * (d * d)) / t_0;
	tmp = 0.0;
	if ((t_2 * (t_3 + sqrt(((t_3 * t_3) - (M * M))))) <= Inf)
		tmp = t_2 * (t_1 + sqrt(((t_1 * t_1) - (M * M))));
	else
		tmp = 0.5 * ((c0 * sqrt(-(M ^ 2.0))) / w);
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(N[(w * h), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(c0 * d), $MachinePrecision] * d), $MachinePrecision] / t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(c0 / N[(2.0 * w), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(c0 * N[(d * d), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]}, If[LessEqual[N[(t$95$2 * N[(t$95$3 + N[Sqrt[N[(N[(t$95$3 * t$95$3), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(t$95$2 * N[(t$95$1 + N[Sqrt[N[(N[(t$95$1 * t$95$1), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(N[(c0 * N[Sqrt[(-N[Power[M, 2.0], $MachinePrecision])], $MachinePrecision]), $MachinePrecision] / w), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M))))) < +inf.0

   1. Initial program 24.7%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   3. Applied rewrites 24.4%

      \[\leadsto \frac{c0}{2 \cdot w} \cdot \left(\frac{\color{blue}{\left(c0 \cdot d\right) \cdot d}}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   5. Applied rewrites 24.6%

      \[\leadsto \frac{c0}{2 \cdot w} \cdot \left(\frac{\left(c0 \cdot d\right) \cdot d}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{\color{blue}{\left(c0 \cdot d\right) \cdot d}}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   7. Applied rewrites 27.3%

      \[\leadsto \frac{c0}{2 \cdot w} \cdot \left(\frac{\left(c0 \cdot d\right) \cdot d}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{\left(c0 \cdot d\right) \cdot d}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{\color{blue}{\left(c0 \cdot d\right) \cdot d}}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   if +inf.0 < (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M)))))

   1. Initial program 24.7%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   2. Taylor expanded in c0 around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{c0 \cdot \sqrt{\mathsf{neg}\left({M}^{2}\right)}}{w}} \]

   4. Applied rewrites 14.4%

      \[\leadsto \color{blue}{0.5 \cdot \frac{c0 \cdot \sqrt{-{M}^{2}}}{w}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 36.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{c0}{2 \cdot w}\\ t_1 := c0 \cdot \left(d \cdot d\right)\\ t_2 := \frac{t\_1}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)}\\ t_3 := \frac{t\_1}{\left(\left(w \cdot h\right) \cdot D\right) \cdot D}\\ \mathbf{if}\;t\_0 \cdot \left(t\_2 + \sqrt{t\_2 \cdot t\_2 - M \cdot M}\right) \leq \infty:\\ \;\;\;\;t\_0 \cdot \left(t\_3 + \sqrt{t\_3 \cdot t\_3 - M \cdot M}\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{c0 \cdot \sqrt{-{M}^{2}}}{w}\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 w h D d M)
 :precision binary64
 (let* ((t_0 (/ c0 (* 2.0 w)))
        (t_1 (* c0 (* d d)))
        (t_2 (/ t_1 (* (* w h) (* D D))))
        (t_3 (/ t_1 (* (* (* w h) D) D))))
   (if (<= (* t_0 (+ t_2 (sqrt (- (* t_2 t_2) (* M M))))) INFINITY)
     (* t_0 (+ t_3 (sqrt (- (* t_3 t_3) (* M M)))))
     (* 0.5 (/ (* c0 (sqrt (- (pow M 2.0)))) w)))))

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = c0 / (2.0 * w);
	double t_1 = c0 * (d * d);
	double t_2 = t_1 / ((w * h) * (D * D));
	double t_3 = t_1 / (((w * h) * D) * D);
	double tmp;
	if ((t_0 * (t_2 + sqrt(((t_2 * t_2) - (M * M))))) <= ((double) INFINITY)) {
		tmp = t_0 * (t_3 + sqrt(((t_3 * t_3) - (M * M))));
	} else {
		tmp = 0.5 * ((c0 * sqrt(-pow(M, 2.0))) / w);
	}
	return tmp;
}

Java

public static double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = c0 / (2.0 * w);
	double t_1 = c0 * (d * d);
	double t_2 = t_1 / ((w * h) * (D * D));
	double t_3 = t_1 / (((w * h) * D) * D);
	double tmp;
	if ((t_0 * (t_2 + Math.sqrt(((t_2 * t_2) - (M * M))))) <= Double.POSITIVE_INFINITY) {
		tmp = t_0 * (t_3 + Math.sqrt(((t_3 * t_3) - (M * M))));
	} else {
		tmp = 0.5 * ((c0 * Math.sqrt(-Math.pow(M, 2.0))) / w);
	}
	return tmp;
}

Python

def code(c0, w, h, D, d, M):
	t_0 = c0 / (2.0 * w)
	t_1 = c0 * (d * d)
	t_2 = t_1 / ((w * h) * (D * D))
	t_3 = t_1 / (((w * h) * D) * D)
	tmp = 0
	if (t_0 * (t_2 + math.sqrt(((t_2 * t_2) - (M * M))))) <= math.inf:
		tmp = t_0 * (t_3 + math.sqrt(((t_3 * t_3) - (M * M))))
	else:
		tmp = 0.5 * ((c0 * math.sqrt(-math.pow(M, 2.0))) / w)
	return tmp

Julia

function code(c0, w, h, D, d, M)
	t_0 = Float64(c0 / Float64(2.0 * w))
	t_1 = Float64(c0 * Float64(d * d))
	t_2 = Float64(t_1 / Float64(Float64(w * h) * Float64(D * D)))
	t_3 = Float64(t_1 / Float64(Float64(Float64(w * h) * D) * D))
	tmp = 0.0
	if (Float64(t_0 * Float64(t_2 + sqrt(Float64(Float64(t_2 * t_2) - Float64(M * M))))) <= Inf)
		tmp = Float64(t_0 * Float64(t_3 + sqrt(Float64(Float64(t_3 * t_3) - Float64(M * M)))));
	else
		tmp = Float64(0.5 * Float64(Float64(c0 * sqrt(Float64(-(M ^ 2.0)))) / w));
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, w, h, D, d, M)
	t_0 = c0 / (2.0 * w);
	t_1 = c0 * (d * d);
	t_2 = t_1 / ((w * h) * (D * D));
	t_3 = t_1 / (((w * h) * D) * D);
	tmp = 0.0;
	if ((t_0 * (t_2 + sqrt(((t_2 * t_2) - (M * M))))) <= Inf)
		tmp = t_0 * (t_3 + sqrt(((t_3 * t_3) - (M * M))));
	else
		tmp = 0.5 * ((c0 * sqrt(-(M ^ 2.0))) / w);
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(c0 / N[(2.0 * w), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(c0 * N[(d * d), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 / N[(N[(w * h), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$1 / N[(N[(N[(w * h), $MachinePrecision] * D), $MachinePrecision] * D), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t$95$0 * N[(t$95$2 + N[Sqrt[N[(N[(t$95$2 * t$95$2), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(t$95$0 * N[(t$95$3 + N[Sqrt[N[(N[(t$95$3 * t$95$3), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(N[(c0 * N[Sqrt[(-N[Power[M, 2.0], $MachinePrecision])], $MachinePrecision]), $MachinePrecision] / w), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M))))) < +inf.0

   1. Initial program 24.7%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   3. Applied rewrites 24.3%

      \[\leadsto \frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\color{blue}{\left(\left(w \cdot h\right) \cdot D\right) \cdot D}} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   5. Applied rewrites 24.4%

      \[\leadsto \frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(\left(w \cdot h\right) \cdot D\right) \cdot D} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\color{blue}{\left(\left(w \cdot h\right) \cdot D\right) \cdot D}} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   7. Applied rewrites 27.2%

      \[\leadsto \frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(\left(w \cdot h\right) \cdot D\right) \cdot D} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(\left(w \cdot h\right) \cdot D\right) \cdot D} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\color{blue}{\left(\left(w \cdot h\right) \cdot D\right) \cdot D}} - M \cdot M}\right) \]

   if +inf.0 < (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M)))))

   1. Initial program 24.7%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   2. Taylor expanded in c0 around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{c0 \cdot \sqrt{\mathsf{neg}\left({M}^{2}\right)}}{w}} \]

   4. Applied rewrites 14.4%

      \[\leadsto \color{blue}{0.5 \cdot \frac{c0 \cdot \sqrt{-{M}^{2}}}{w}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 36.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(w \cdot h\right) \cdot \left(D \cdot D\right)\\ t_1 := c0 \cdot \frac{d \cdot d}{t\_0}\\ t_2 := \frac{c0}{2 \cdot w}\\ t_3 := \frac{c0 \cdot \left(d \cdot d\right)}{t\_0}\\ \mathbf{if}\;t\_2 \cdot \left(t\_3 + \sqrt{t\_3 \cdot t\_3 - M \cdot M}\right) \leq \infty:\\ \;\;\;\;t\_2 \cdot \left(t\_1 + \sqrt{t\_1 \cdot t\_1 - M \cdot M}\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{c0 \cdot \sqrt{-{M}^{2}}}{w}\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 w h D d M)
 :precision binary64
 (let* ((t_0 (* (* w h) (* D D)))
        (t_1 (* c0 (/ (* d d) t_0)))
        (t_2 (/ c0 (* 2.0 w)))
        (t_3 (/ (* c0 (* d d)) t_0)))
   (if (<= (* t_2 (+ t_3 (sqrt (- (* t_3 t_3) (* M M))))) INFINITY)
     (* t_2 (+ t_1 (sqrt (- (* t_1 t_1) (* M M)))))
     (* 0.5 (/ (* c0 (sqrt (- (pow M 2.0)))) w)))))

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (w * h) * (D * D);
	double t_1 = c0 * ((d * d) / t_0);
	double t_2 = c0 / (2.0 * w);
	double t_3 = (c0 * (d * d)) / t_0;
	double tmp;
	if ((t_2 * (t_3 + sqrt(((t_3 * t_3) - (M * M))))) <= ((double) INFINITY)) {
		tmp = t_2 * (t_1 + sqrt(((t_1 * t_1) - (M * M))));
	} else {
		tmp = 0.5 * ((c0 * sqrt(-pow(M, 2.0))) / w);
	}
	return tmp;
}

Java

public static double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (w * h) * (D * D);
	double t_1 = c0 * ((d * d) / t_0);
	double t_2 = c0 / (2.0 * w);
	double t_3 = (c0 * (d * d)) / t_0;
	double tmp;
	if ((t_2 * (t_3 + Math.sqrt(((t_3 * t_3) - (M * M))))) <= Double.POSITIVE_INFINITY) {
		tmp = t_2 * (t_1 + Math.sqrt(((t_1 * t_1) - (M * M))));
	} else {
		tmp = 0.5 * ((c0 * Math.sqrt(-Math.pow(M, 2.0))) / w);
	}
	return tmp;
}

Python

def code(c0, w, h, D, d, M):
	t_0 = (w * h) * (D * D)
	t_1 = c0 * ((d * d) / t_0)
	t_2 = c0 / (2.0 * w)
	t_3 = (c0 * (d * d)) / t_0
	tmp = 0
	if (t_2 * (t_3 + math.sqrt(((t_3 * t_3) - (M * M))))) <= math.inf:
		tmp = t_2 * (t_1 + math.sqrt(((t_1 * t_1) - (M * M))))
	else:
		tmp = 0.5 * ((c0 * math.sqrt(-math.pow(M, 2.0))) / w)
	return tmp

Julia

function code(c0, w, h, D, d, M)
	t_0 = Float64(Float64(w * h) * Float64(D * D))
	t_1 = Float64(c0 * Float64(Float64(d * d) / t_0))
	t_2 = Float64(c0 / Float64(2.0 * w))
	t_3 = Float64(Float64(c0 * Float64(d * d)) / t_0)
	tmp = 0.0
	if (Float64(t_2 * Float64(t_3 + sqrt(Float64(Float64(t_3 * t_3) - Float64(M * M))))) <= Inf)
		tmp = Float64(t_2 * Float64(t_1 + sqrt(Float64(Float64(t_1 * t_1) - Float64(M * M)))));
	else
		tmp = Float64(0.5 * Float64(Float64(c0 * sqrt(Float64(-(M ^ 2.0)))) / w));
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, w, h, D, d, M)
	t_0 = (w * h) * (D * D);
	t_1 = c0 * ((d * d) / t_0);
	t_2 = c0 / (2.0 * w);
	t_3 = (c0 * (d * d)) / t_0;
	tmp = 0.0;
	if ((t_2 * (t_3 + sqrt(((t_3 * t_3) - (M * M))))) <= Inf)
		tmp = t_2 * (t_1 + sqrt(((t_1 * t_1) - (M * M))));
	else
		tmp = 0.5 * ((c0 * sqrt(-(M ^ 2.0))) / w);
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(N[(w * h), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(c0 * N[(N[(d * d), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(c0 / N[(2.0 * w), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(c0 * N[(d * d), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]}, If[LessEqual[N[(t$95$2 * N[(t$95$3 + N[Sqrt[N[(N[(t$95$3 * t$95$3), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(t$95$2 * N[(t$95$1 + N[Sqrt[N[(N[(t$95$1 * t$95$1), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(N[(c0 * N[Sqrt[(-N[Power[M, 2.0], $MachinePrecision])], $MachinePrecision]), $MachinePrecision] / w), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M))))) < +inf.0

   1. Initial program 24.7%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   3. Applied rewrites 24.2%

      \[\leadsto \frac{c0}{2 \cdot w} \cdot \left(\color{blue}{c0 \cdot \frac{d \cdot d}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)}} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   5. Applied rewrites 24.3%

      \[\leadsto \frac{c0}{2 \cdot w} \cdot \left(c0 \cdot \frac{d \cdot d}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\color{blue}{\left(c0 \cdot \frac{d \cdot d}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)}\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   7. Applied rewrites 25.0%

      \[\leadsto \frac{c0}{2 \cdot w} \cdot \left(c0 \cdot \frac{d \cdot d}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\left(c0 \cdot \frac{d \cdot d}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)}\right) \cdot \color{blue}{\left(c0 \cdot \frac{d \cdot d}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)}\right)} - M \cdot M}\right) \]

   if +inf.0 < (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M)))))

   1. Initial program 24.7%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   2. Taylor expanded in c0 around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{c0 \cdot \sqrt{\mathsf{neg}\left({M}^{2}\right)}}{w}} \]

   4. Applied rewrites 14.4%

      \[\leadsto \color{blue}{0.5 \cdot \frac{c0 \cdot \sqrt{-{M}^{2}}}{w}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 36.3% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{c0}{2 \cdot w}\\ t_1 := \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)}\\ \mathbf{if}\;t\_0 \cdot \left(t\_1 + \sqrt{t\_1 \cdot t\_1 - M \cdot M}\right) \leq \infty:\\ \;\;\;\;t\_0 \cdot \left(t\_1 + \sqrt{{t\_1}^{2} - M \cdot M}\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{c0 \cdot \sqrt{-{M}^{2}}}{w}\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 w h D d M)
 :precision binary64
 (let* ((t_0 (/ c0 (* 2.0 w))) (t_1 (/ (* c0 (* d d)) (* (* w h) (* D D)))))
   (if (<= (* t_0 (+ t_1 (sqrt (- (* t_1 t_1) (* M M))))) INFINITY)
     (* t_0 (+ t_1 (sqrt (- (pow t_1 2.0) (* M M)))))
     (* 0.5 (/ (* c0 (sqrt (- (pow M 2.0)))) w)))))

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = c0 / (2.0 * w);
	double t_1 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if ((t_0 * (t_1 + sqrt(((t_1 * t_1) - (M * M))))) <= ((double) INFINITY)) {
		tmp = t_0 * (t_1 + sqrt((pow(t_1, 2.0) - (M * M))));
	} else {
		tmp = 0.5 * ((c0 * sqrt(-pow(M, 2.0))) / w);
	}
	return tmp;
}

Java

public static double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = c0 / (2.0 * w);
	double t_1 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if ((t_0 * (t_1 + Math.sqrt(((t_1 * t_1) - (M * M))))) <= Double.POSITIVE_INFINITY) {
		tmp = t_0 * (t_1 + Math.sqrt((Math.pow(t_1, 2.0) - (M * M))));
	} else {
		tmp = 0.5 * ((c0 * Math.sqrt(-Math.pow(M, 2.0))) / w);
	}
	return tmp;
}

Python

def code(c0, w, h, D, d, M):
	t_0 = c0 / (2.0 * w)
	t_1 = (c0 * (d * d)) / ((w * h) * (D * D))
	tmp = 0
	if (t_0 * (t_1 + math.sqrt(((t_1 * t_1) - (M * M))))) <= math.inf:
		tmp = t_0 * (t_1 + math.sqrt((math.pow(t_1, 2.0) - (M * M))))
	else:
		tmp = 0.5 * ((c0 * math.sqrt(-math.pow(M, 2.0))) / w)
	return tmp

Julia

function code(c0, w, h, D, d, M)
	t_0 = Float64(c0 / Float64(2.0 * w))
	t_1 = Float64(Float64(c0 * Float64(d * d)) / Float64(Float64(w * h) * Float64(D * D)))
	tmp = 0.0
	if (Float64(t_0 * Float64(t_1 + sqrt(Float64(Float64(t_1 * t_1) - Float64(M * M))))) <= Inf)
		tmp = Float64(t_0 * Float64(t_1 + sqrt(Float64((t_1 ^ 2.0) - Float64(M * M)))));
	else
		tmp = Float64(0.5 * Float64(Float64(c0 * sqrt(Float64(-(M ^ 2.0)))) / w));
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, w, h, D, d, M)
	t_0 = c0 / (2.0 * w);
	t_1 = (c0 * (d * d)) / ((w * h) * (D * D));
	tmp = 0.0;
	if ((t_0 * (t_1 + sqrt(((t_1 * t_1) - (M * M))))) <= Inf)
		tmp = t_0 * (t_1 + sqrt(((t_1 ^ 2.0) - (M * M))));
	else
		tmp = 0.5 * ((c0 * sqrt(-(M ^ 2.0))) / w);
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(c0 / N[(2.0 * w), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(c0 * N[(d * d), $MachinePrecision]), $MachinePrecision] / N[(N[(w * h), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t$95$0 * N[(t$95$1 + N[Sqrt[N[(N[(t$95$1 * t$95$1), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(t$95$0 * N[(t$95$1 + N[Sqrt[N[(N[Power[t$95$1, 2.0], $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(N[(c0 * N[Sqrt[(-N[Power[M, 2.0], $MachinePrecision])], $MachinePrecision]), $MachinePrecision] / w), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M))))) < +inf.0

   1. Initial program 24.7%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   3. Applied rewrites 24.7%

      \[\leadsto \frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \color{blue}{\sqrt{{\left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)}\right)}^{2} - M \cdot M}}\right) \]

   if +inf.0 < (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M)))))

   1. Initial program 24.7%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   2. Taylor expanded in c0 around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{c0 \cdot \sqrt{\mathsf{neg}\left({M}^{2}\right)}}{w}} \]

   4. Applied rewrites 14.4%

      \[\leadsto \color{blue}{0.5 \cdot \frac{c0 \cdot \sqrt{-{M}^{2}}}{w}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 35.3% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(w \cdot h\right) \cdot \left(D \cdot D\right)\\ t_1 := \frac{c0 \cdot \left(d \cdot d\right)}{t\_0}\\ \mathbf{if}\;\frac{c0}{2 \cdot w} \cdot \left(t\_1 + \sqrt{t\_1 \cdot t\_1 - M \cdot M}\right) \leq \infty:\\ \;\;\;\;\mathsf{fma}\left(c0, \frac{d \cdot d}{t\_0}, \sqrt{{t\_1}^{2} - M \cdot M}\right) \cdot \frac{c0}{w + w}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{c0 \cdot \sqrt{-{M}^{2}}}{w}\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 w h D d M)
 :precision binary64
 (let* ((t_0 (* (* w h) (* D D))) (t_1 (/ (* c0 (* d d)) t_0)))
   (if (<=
        (* (/ c0 (* 2.0 w)) (+ t_1 (sqrt (- (* t_1 t_1) (* M M)))))
        INFINITY)
     (*
      (fma c0 (/ (* d d) t_0) (sqrt (- (pow t_1 2.0) (* M M))))
      (/ c0 (+ w w)))
     (* 0.5 (/ (* c0 (sqrt (- (pow M 2.0)))) w)))))

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (w * h) * (D * D);
	double t_1 = (c0 * (d * d)) / t_0;
	double tmp;
	if (((c0 / (2.0 * w)) * (t_1 + sqrt(((t_1 * t_1) - (M * M))))) <= ((double) INFINITY)) {
		tmp = fma(c0, ((d * d) / t_0), sqrt((pow(t_1, 2.0) - (M * M)))) * (c0 / (w + w));
	} else {
		tmp = 0.5 * ((c0 * sqrt(-pow(M, 2.0))) / w);
	}
	return tmp;
}

Julia

function code(c0, w, h, D, d, M)
	t_0 = Float64(Float64(w * h) * Float64(D * D))
	t_1 = Float64(Float64(c0 * Float64(d * d)) / t_0)
	tmp = 0.0
	if (Float64(Float64(c0 / Float64(2.0 * w)) * Float64(t_1 + sqrt(Float64(Float64(t_1 * t_1) - Float64(M * M))))) <= Inf)
		tmp = Float64(fma(c0, Float64(Float64(d * d) / t_0), sqrt(Float64((t_1 ^ 2.0) - Float64(M * M)))) * Float64(c0 / Float64(w + w)));
	else
		tmp = Float64(0.5 * Float64(Float64(c0 * sqrt(Float64(-(M ^ 2.0)))) / w));
	end
	return tmp
end

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(N[(w * h), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(c0 * N[(d * d), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]}, If[LessEqual[N[(N[(c0 / N[(2.0 * w), $MachinePrecision]), $MachinePrecision] * N[(t$95$1 + N[Sqrt[N[(N[(t$95$1 * t$95$1), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(c0 * N[(N[(d * d), $MachinePrecision] / t$95$0), $MachinePrecision] + N[Sqrt[N[(N[Power[t$95$1, 2.0], $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(c0 / N[(w + w), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(N[(c0 * N[Sqrt[(-N[Power[M, 2.0], $MachinePrecision])], $MachinePrecision]), $MachinePrecision] / w), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M))))) < +inf.0

   1. Initial program 24.7%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   3. Applied rewrites 23.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(c0, \frac{d \cdot d}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)}, \sqrt{{\left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)}\right)}^{2} - M \cdot M}\right) \cdot \frac{c0}{w + w}} \]

   if +inf.0 < (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M)))))

   1. Initial program 24.7%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   2. Taylor expanded in c0 around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{c0 \cdot \sqrt{\mathsf{neg}\left({M}^{2}\right)}}{w}} \]

   4. Applied rewrites 14.4%

      \[\leadsto \color{blue}{0.5 \cdot \frac{c0 \cdot \sqrt{-{M}^{2}}}{w}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 23.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{c0}{2 \cdot w}\\ t_1 := \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)}\\ \mathbf{if}\;t\_0 \cdot \left(t\_1 + \sqrt{t\_1 \cdot t\_1 - M \cdot M}\right) \leq \infty:\\ \;\;\;\;t\_0 \cdot \left(t\_1 + \sqrt{M \cdot \left(t\_1 - M\right)}\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{c0 \cdot \sqrt{-{M}^{2}}}{w}\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 w h D d M)
 :precision binary64
 (let* ((t_0 (/ c0 (* 2.0 w))) (t_1 (/ (* c0 (* d d)) (* (* w h) (* D D)))))
   (if (<= (* t_0 (+ t_1 (sqrt (- (* t_1 t_1) (* M M))))) INFINITY)
     (* t_0 (+ t_1 (sqrt (* M (- t_1 M)))))
     (* 0.5 (/ (* c0 (sqrt (- (pow M 2.0)))) w)))))

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = c0 / (2.0 * w);
	double t_1 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if ((t_0 * (t_1 + sqrt(((t_1 * t_1) - (M * M))))) <= ((double) INFINITY)) {
		tmp = t_0 * (t_1 + sqrt((M * (t_1 - M))));
	} else {
		tmp = 0.5 * ((c0 * sqrt(-pow(M, 2.0))) / w);
	}
	return tmp;
}

Java

public static double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = c0 / (2.0 * w);
	double t_1 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if ((t_0 * (t_1 + Math.sqrt(((t_1 * t_1) - (M * M))))) <= Double.POSITIVE_INFINITY) {
		tmp = t_0 * (t_1 + Math.sqrt((M * (t_1 - M))));
	} else {
		tmp = 0.5 * ((c0 * Math.sqrt(-Math.pow(M, 2.0))) / w);
	}
	return tmp;
}

Python

def code(c0, w, h, D, d, M):
	t_0 = c0 / (2.0 * w)
	t_1 = (c0 * (d * d)) / ((w * h) * (D * D))
	tmp = 0
	if (t_0 * (t_1 + math.sqrt(((t_1 * t_1) - (M * M))))) <= math.inf:
		tmp = t_0 * (t_1 + math.sqrt((M * (t_1 - M))))
	else:
		tmp = 0.5 * ((c0 * math.sqrt(-math.pow(M, 2.0))) / w)
	return tmp

Julia

function code(c0, w, h, D, d, M)
	t_0 = Float64(c0 / Float64(2.0 * w))
	t_1 = Float64(Float64(c0 * Float64(d * d)) / Float64(Float64(w * h) * Float64(D * D)))
	tmp = 0.0
	if (Float64(t_0 * Float64(t_1 + sqrt(Float64(Float64(t_1 * t_1) - Float64(M * M))))) <= Inf)
		tmp = Float64(t_0 * Float64(t_1 + sqrt(Float64(M * Float64(t_1 - M)))));
	else
		tmp = Float64(0.5 * Float64(Float64(c0 * sqrt(Float64(-(M ^ 2.0)))) / w));
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, w, h, D, d, M)
	t_0 = c0 / (2.0 * w);
	t_1 = (c0 * (d * d)) / ((w * h) * (D * D));
	tmp = 0.0;
	if ((t_0 * (t_1 + sqrt(((t_1 * t_1) - (M * M))))) <= Inf)
		tmp = t_0 * (t_1 + sqrt((M * (t_1 - M))));
	else
		tmp = 0.5 * ((c0 * sqrt(-(M ^ 2.0))) / w);
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(c0 / N[(2.0 * w), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(c0 * N[(d * d), $MachinePrecision]), $MachinePrecision] / N[(N[(w * h), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t$95$0 * N[(t$95$1 + N[Sqrt[N[(N[(t$95$1 * t$95$1), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(t$95$0 * N[(t$95$1 + N[Sqrt[N[(M * N[(t$95$1 - M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(N[(c0 * N[Sqrt[(-N[Power[M, 2.0], $MachinePrecision])], $MachinePrecision]), $MachinePrecision] / w), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M))))) < +inf.0

   1. Initial program 24.7%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   3. Applied rewrites 30.3%

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

   4. Taylor expanded in c0 around 0

      \[\leadsto \frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\color{blue}{M} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M\right)}\right) \]

   6. Applied rewrites 14.8%

      \[\leadsto \frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\color{blue}{M} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M\right)}\right) \]

   if +inf.0 < (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M)))))

   1. Initial program 24.7%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   2. Taylor expanded in c0 around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{c0 \cdot \sqrt{\mathsf{neg}\left({M}^{2}\right)}}{w}} \]

   4. Applied rewrites 14.4%

      \[\leadsto \color{blue}{0.5 \cdot \frac{c0 \cdot \sqrt{-{M}^{2}}}{w}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 19.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(w \cdot h\right) \cdot \left(D \cdot D\right)\\ t_1 := \frac{c0}{2 \cdot w}\\ t_2 := \frac{c0 \cdot \left(d \cdot d\right)}{t\_0}\\ \mathbf{if}\;t\_1 \cdot \left(t\_2 + \sqrt{t\_2 \cdot t\_2 - M \cdot M}\right) \leq \infty:\\ \;\;\;\;t\_1 \cdot \left(\frac{\left(c0 \cdot d\right) \cdot d}{t\_0} + \sqrt{-1 \cdot {M}^{2}}\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{c0 \cdot \sqrt{-{M}^{2}}}{w}\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 w h D d M)
 :precision binary64
 (let* ((t_0 (* (* w h) (* D D)))
        (t_1 (/ c0 (* 2.0 w)))
        (t_2 (/ (* c0 (* d d)) t_0)))
   (if (<= (* t_1 (+ t_2 (sqrt (- (* t_2 t_2) (* M M))))) INFINITY)
     (* t_1 (+ (/ (* (* c0 d) d) t_0) (sqrt (* -1.0 (pow M 2.0)))))
     (* 0.5 (/ (* c0 (sqrt (- (pow M 2.0)))) w)))))

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (w * h) * (D * D);
	double t_1 = c0 / (2.0 * w);
	double t_2 = (c0 * (d * d)) / t_0;
	double tmp;
	if ((t_1 * (t_2 + sqrt(((t_2 * t_2) - (M * M))))) <= ((double) INFINITY)) {
		tmp = t_1 * ((((c0 * d) * d) / t_0) + sqrt((-1.0 * pow(M, 2.0))));
	} else {
		tmp = 0.5 * ((c0 * sqrt(-pow(M, 2.0))) / w);
	}
	return tmp;
}

Java

public static double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (w * h) * (D * D);
	double t_1 = c0 / (2.0 * w);
	double t_2 = (c0 * (d * d)) / t_0;
	double tmp;
	if ((t_1 * (t_2 + Math.sqrt(((t_2 * t_2) - (M * M))))) <= Double.POSITIVE_INFINITY) {
		tmp = t_1 * ((((c0 * d) * d) / t_0) + Math.sqrt((-1.0 * Math.pow(M, 2.0))));
	} else {
		tmp = 0.5 * ((c0 * Math.sqrt(-Math.pow(M, 2.0))) / w);
	}
	return tmp;
}

Python

def code(c0, w, h, D, d, M):
	t_0 = (w * h) * (D * D)
	t_1 = c0 / (2.0 * w)
	t_2 = (c0 * (d * d)) / t_0
	tmp = 0
	if (t_1 * (t_2 + math.sqrt(((t_2 * t_2) - (M * M))))) <= math.inf:
		tmp = t_1 * ((((c0 * d) * d) / t_0) + math.sqrt((-1.0 * math.pow(M, 2.0))))
	else:
		tmp = 0.5 * ((c0 * math.sqrt(-math.pow(M, 2.0))) / w)
	return tmp

Julia

function code(c0, w, h, D, d, M)
	t_0 = Float64(Float64(w * h) * Float64(D * D))
	t_1 = Float64(c0 / Float64(2.0 * w))
	t_2 = Float64(Float64(c0 * Float64(d * d)) / t_0)
	tmp = 0.0
	if (Float64(t_1 * Float64(t_2 + sqrt(Float64(Float64(t_2 * t_2) - Float64(M * M))))) <= Inf)
		tmp = Float64(t_1 * Float64(Float64(Float64(Float64(c0 * d) * d) / t_0) + sqrt(Float64(-1.0 * (M ^ 2.0)))));
	else
		tmp = Float64(0.5 * Float64(Float64(c0 * sqrt(Float64(-(M ^ 2.0)))) / w));
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, w, h, D, d, M)
	t_0 = (w * h) * (D * D);
	t_1 = c0 / (2.0 * w);
	t_2 = (c0 * (d * d)) / t_0;
	tmp = 0.0;
	if ((t_1 * (t_2 + sqrt(((t_2 * t_2) - (M * M))))) <= Inf)
		tmp = t_1 * ((((c0 * d) * d) / t_0) + sqrt((-1.0 * (M ^ 2.0))));
	else
		tmp = 0.5 * ((c0 * sqrt(-(M ^ 2.0))) / w);
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(N[(w * h), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(c0 / N[(2.0 * w), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(c0 * N[(d * d), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]}, If[LessEqual[N[(t$95$1 * N[(t$95$2 + N[Sqrt[N[(N[(t$95$2 * t$95$2), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(t$95$1 * N[(N[(N[(N[(c0 * d), $MachinePrecision] * d), $MachinePrecision] / t$95$0), $MachinePrecision] + N[Sqrt[N[(-1.0 * N[Power[M, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(N[(c0 * N[Sqrt[(-N[Power[M, 2.0], $MachinePrecision])], $MachinePrecision]), $MachinePrecision] / w), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M))))) < +inf.0

   1. Initial program 24.7%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   3. Applied rewrites 24.4%

      \[\leadsto \frac{c0}{2 \cdot w} \cdot \left(\frac{\color{blue}{\left(c0 \cdot d\right) \cdot d}}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   5. Applied rewrites 24.6%

      \[\leadsto \frac{c0}{2 \cdot w} \cdot \left(\frac{\left(c0 \cdot d\right) \cdot d}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{\color{blue}{\left(c0 \cdot d\right) \cdot d}}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   7. Applied rewrites 27.3%

      \[\leadsto \frac{c0}{2 \cdot w} \cdot \left(\frac{\left(c0 \cdot d\right) \cdot d}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{\left(c0 \cdot d\right) \cdot d}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{\color{blue}{\left(c0 \cdot d\right) \cdot d}}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   8. Taylor expanded in c0 around 0

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

   10. Applied rewrites 8.9%

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

   if +inf.0 < (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M)))))

   1. Initial program 24.7%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   2. Taylor expanded in c0 around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{c0 \cdot \sqrt{\mathsf{neg}\left({M}^{2}\right)}}{w}} \]

   4. Applied rewrites 14.4%

      \[\leadsto \color{blue}{0.5 \cdot \frac{c0 \cdot \sqrt{-{M}^{2}}}{w}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 19.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{c0}{2 \cdot w}\\ t_1 := \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)}\\ \mathbf{if}\;t\_0 \cdot \left(t\_1 + \sqrt{t\_1 \cdot t\_1 - M \cdot M}\right) \leq \infty:\\ \;\;\;\;t\_0 \cdot \left(t\_1 + \sqrt{-1 \cdot {M}^{2}}\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{c0 \cdot \sqrt{-{M}^{2}}}{w}\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 w h D d M)
 :precision binary64
 (let* ((t_0 (/ c0 (* 2.0 w))) (t_1 (/ (* c0 (* d d)) (* (* w h) (* D D)))))
   (if (<= (* t_0 (+ t_1 (sqrt (- (* t_1 t_1) (* M M))))) INFINITY)
     (* t_0 (+ t_1 (sqrt (* -1.0 (pow M 2.0)))))
     (* 0.5 (/ (* c0 (sqrt (- (pow M 2.0)))) w)))))

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = c0 / (2.0 * w);
	double t_1 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if ((t_0 * (t_1 + sqrt(((t_1 * t_1) - (M * M))))) <= ((double) INFINITY)) {
		tmp = t_0 * (t_1 + sqrt((-1.0 * pow(M, 2.0))));
	} else {
		tmp = 0.5 * ((c0 * sqrt(-pow(M, 2.0))) / w);
	}
	return tmp;
}

Java

public static double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = c0 / (2.0 * w);
	double t_1 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if ((t_0 * (t_1 + Math.sqrt(((t_1 * t_1) - (M * M))))) <= Double.POSITIVE_INFINITY) {
		tmp = t_0 * (t_1 + Math.sqrt((-1.0 * Math.pow(M, 2.0))));
	} else {
		tmp = 0.5 * ((c0 * Math.sqrt(-Math.pow(M, 2.0))) / w);
	}
	return tmp;
}

Python

def code(c0, w, h, D, d, M):
	t_0 = c0 / (2.0 * w)
	t_1 = (c0 * (d * d)) / ((w * h) * (D * D))
	tmp = 0
	if (t_0 * (t_1 + math.sqrt(((t_1 * t_1) - (M * M))))) <= math.inf:
		tmp = t_0 * (t_1 + math.sqrt((-1.0 * math.pow(M, 2.0))))
	else:
		tmp = 0.5 * ((c0 * math.sqrt(-math.pow(M, 2.0))) / w)
	return tmp

Julia

function code(c0, w, h, D, d, M)
	t_0 = Float64(c0 / Float64(2.0 * w))
	t_1 = Float64(Float64(c0 * Float64(d * d)) / Float64(Float64(w * h) * Float64(D * D)))
	tmp = 0.0
	if (Float64(t_0 * Float64(t_1 + sqrt(Float64(Float64(t_1 * t_1) - Float64(M * M))))) <= Inf)
		tmp = Float64(t_0 * Float64(t_1 + sqrt(Float64(-1.0 * (M ^ 2.0)))));
	else
		tmp = Float64(0.5 * Float64(Float64(c0 * sqrt(Float64(-(M ^ 2.0)))) / w));
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, w, h, D, d, M)
	t_0 = c0 / (2.0 * w);
	t_1 = (c0 * (d * d)) / ((w * h) * (D * D));
	tmp = 0.0;
	if ((t_0 * (t_1 + sqrt(((t_1 * t_1) - (M * M))))) <= Inf)
		tmp = t_0 * (t_1 + sqrt((-1.0 * (M ^ 2.0))));
	else
		tmp = 0.5 * ((c0 * sqrt(-(M ^ 2.0))) / w);
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(c0 / N[(2.0 * w), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(c0 * N[(d * d), $MachinePrecision]), $MachinePrecision] / N[(N[(w * h), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t$95$0 * N[(t$95$1 + N[Sqrt[N[(N[(t$95$1 * t$95$1), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(t$95$0 * N[(t$95$1 + N[Sqrt[N[(-1.0 * N[Power[M, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(N[(c0 * N[Sqrt[(-N[Power[M, 2.0], $MachinePrecision])], $MachinePrecision]), $MachinePrecision] / w), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M))))) < +inf.0

   1. Initial program 24.7%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   2. Taylor expanded in c0 around 0

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

   4. Applied rewrites 8.0%

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

   if +inf.0 < (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M)))))

   1. Initial program 24.7%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

   2. Taylor expanded in c0 around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{c0 \cdot \sqrt{\mathsf{neg}\left({M}^{2}\right)}}{w}} \]

   4. Applied rewrites 14.4%

      \[\leadsto \color{blue}{0.5 \cdot \frac{c0 \cdot \sqrt{-{M}^{2}}}{w}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 14.4% accurate, 2.7× speedup

Math

\[\begin{array}{l} \\ 0.5 \cdot \frac{c0 \cdot \sqrt{-{M}^{2}}}{w} \end{array} \]

FPCore

(FPCore (c0 w h D d M)
 :precision binary64
 (* 0.5 (/ (* c0 (sqrt (- (pow M 2.0)))) w)))

C

double code(double c0, double w, double h, double D, double d, double M) {
	return 0.5 * ((c0 * sqrt(-pow(M, 2.0))) / w);
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(c0, w, h, d, d_1, m)
use fmin_fmax_functions
    real(8), intent (in) :: c0
    real(8), intent (in) :: w
    real(8), intent (in) :: h
    real(8), intent (in) :: d
    real(8), intent (in) :: d_1
    real(8), intent (in) :: m
    code = 0.5d0 * ((c0 * sqrt(-(m ** 2.0d0))) / w)
end function

Java

public static double code(double c0, double w, double h, double D, double d, double M) {
	return 0.5 * ((c0 * Math.sqrt(-Math.pow(M, 2.0))) / w);
}

Python

def code(c0, w, h, D, d, M):
	return 0.5 * ((c0 * math.sqrt(-math.pow(M, 2.0))) / w)

Julia

function code(c0, w, h, D, d, M)
	return Float64(0.5 * Float64(Float64(c0 * sqrt(Float64(-(M ^ 2.0)))) / w))
end

MATLAB

function tmp = code(c0, w, h, D, d, M)
	tmp = 0.5 * ((c0 * sqrt(-(M ^ 2.0))) / w);
end

Wolfram

code[c0_, w_, h_, D_, d_, M_] := N[(0.5 * N[(N[(c0 * N[Sqrt[(-N[Power[M, 2.0], $MachinePrecision])], $MachinePrecision]), $MachinePrecision] / w), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 24.7%

   \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]

2. Taylor expanded in c0 around 0

   \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{c0 \cdot \sqrt{\mathsf{neg}\left({M}^{2}\right)}}{w}} \]

4. Applied rewrites 14.4%

   \[\leadsto \color{blue}{0.5 \cdot \frac{c0 \cdot \sqrt{-{M}^{2}}}{w}} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2025160 
(FPCore (c0 w h D d M)
  :name "Henrywood and Agarwal, Equation (13)"
  :precision binary64
  (* (/ c0 (* 2.0 w)) (+ (/ (* c0 (* d d)) (* (* w h) (* D D))) (sqrt (- (* (/ (* c0 (* d d)) (* (* w h) (* D D))) (/ (* c0 (* d d)) (* (* w h) (* D D)))) (* M M))))))