Henrywood and Agarwal, Equation (3)

Percentage Accurate: 73.7% → 87.9%

Time: 11.7s

Alternatives: 15

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ c0 \cdot \sqrt{\frac{A}{V \cdot \ell}} \end{array} \]

FPCore

(FPCore (c0 A V l) :precision binary64 (* c0 (sqrt (/ A (* V l)))))

C

double code(double c0, double A, double V, double l) {
	return c0 * sqrt((A / (V * l)));
}

Fortran

real(8) function code(c0, a, v, l)
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    code = c0 * sqrt((a / (v * l)))
end function

Java

public static double code(double c0, double A, double V, double l) {
	return c0 * Math.sqrt((A / (V * l)));
}

Python

def code(c0, A, V, l):
	return c0 * math.sqrt((A / (V * l)))

Julia

function code(c0, A, V, l)
	return Float64(c0 * sqrt(Float64(A / Float64(V * l))))
end

MATLAB

function tmp = code(c0, A, V, l)
	tmp = c0 * sqrt((A / (V * l)));
end

Wolfram

code[c0_, A_, V_, l_] := N[(c0 * N[Sqrt[N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Initial Program: 73.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ c0 \cdot \sqrt{\frac{A}{V \cdot \ell}} \end{array} \]

FPCore

(FPCore (c0 A V l) :precision binary64 (* c0 (sqrt (/ A (* V l)))))

C

double code(double c0, double A, double V, double l) {
	return c0 * sqrt((A / (V * l)));
}

Fortran

real(8) function code(c0, a, v, l)
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    code = c0 * sqrt((a / (v * l)))
end function

Java

public static double code(double c0, double A, double V, double l) {
	return c0 * Math.sqrt((A / (V * l)));
}

Python

def code(c0, A, V, l):
	return c0 * math.sqrt((A / (V * l)))

Julia

function code(c0, A, V, l)
	return Float64(c0 * sqrt(Float64(A / Float64(V * l))))
end

MATLAB

function tmp = code(c0, A, V, l)
	tmp = c0 * sqrt((A / (V * l)));
end

Wolfram

code[c0_, A_, V_, l_] := N[(c0 * N[Sqrt[N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Alternative 1: 87.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\ell \cdot V \leq -5 \cdot 10^{+293}:\\ \;\;\;\;\frac{c0}{\sqrt{V \cdot \frac{\ell}{A}}}\\ \mathbf{elif}\;\ell \cdot V \leq -5 \cdot 10^{-305}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{-A}}{\sqrt{\ell \cdot \left(-V\right)}}\\ \mathbf{elif}\;\ell \cdot V \leq 5 \cdot 10^{-271}:\\ \;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{V}}{\ell}}\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \left(\sqrt{A} \cdot \sqrt{\frac{\frac{1}{V}}{\ell}}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 A V l)
 :precision binary64
 (if (<= (* l V) -5e+293)
   (/ c0 (sqrt (* V (/ l A))))
   (if (<= (* l V) -5e-305)
     (* c0 (/ (sqrt (- A)) (sqrt (* l (- V)))))
     (if (<= (* l V) 5e-271)
       (* c0 (sqrt (/ (/ A V) l)))
       (* c0 (* (sqrt A) (sqrt (/ (/ 1.0 V) l))))))))

C

double code(double c0, double A, double V, double l) {
	double tmp;
	if ((l * V) <= -5e+293) {
		tmp = c0 / sqrt((V * (l / A)));
	} else if ((l * V) <= -5e-305) {
		tmp = c0 * (sqrt(-A) / sqrt((l * -V)));
	} else if ((l * V) <= 5e-271) {
		tmp = c0 * sqrt(((A / V) / l));
	} else {
		tmp = c0 * (sqrt(A) * sqrt(((1.0 / V) / l)));
	}
	return tmp;
}

Fortran

real(8) function code(c0, a, v, l)
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    real(8) :: tmp
    if ((l * v) <= (-5d+293)) then
        tmp = c0 / sqrt((v * (l / a)))
    else if ((l * v) <= (-5d-305)) then
        tmp = c0 * (sqrt(-a) / sqrt((l * -v)))
    else if ((l * v) <= 5d-271) then
        tmp = c0 * sqrt(((a / v) / l))
    else
        tmp = c0 * (sqrt(a) * sqrt(((1.0d0 / v) / l)))
    end if
    code = tmp
end function

Java

public static double code(double c0, double A, double V, double l) {
	double tmp;
	if ((l * V) <= -5e+293) {
		tmp = c0 / Math.sqrt((V * (l / A)));
	} else if ((l * V) <= -5e-305) {
		tmp = c0 * (Math.sqrt(-A) / Math.sqrt((l * -V)));
	} else if ((l * V) <= 5e-271) {
		tmp = c0 * Math.sqrt(((A / V) / l));
	} else {
		tmp = c0 * (Math.sqrt(A) * Math.sqrt(((1.0 / V) / l)));
	}
	return tmp;
}

Python

def code(c0, A, V, l):
	tmp = 0
	if (l * V) <= -5e+293:
		tmp = c0 / math.sqrt((V * (l / A)))
	elif (l * V) <= -5e-305:
		tmp = c0 * (math.sqrt(-A) / math.sqrt((l * -V)))
	elif (l * V) <= 5e-271:
		tmp = c0 * math.sqrt(((A / V) / l))
	else:
		tmp = c0 * (math.sqrt(A) * math.sqrt(((1.0 / V) / l)))
	return tmp

Julia

function code(c0, A, V, l)
	tmp = 0.0
	if (Float64(l * V) <= -5e+293)
		tmp = Float64(c0 / sqrt(Float64(V * Float64(l / A))));
	elseif (Float64(l * V) <= -5e-305)
		tmp = Float64(c0 * Float64(sqrt(Float64(-A)) / sqrt(Float64(l * Float64(-V)))));
	elseif (Float64(l * V) <= 5e-271)
		tmp = Float64(c0 * sqrt(Float64(Float64(A / V) / l)));
	else
		tmp = Float64(c0 * Float64(sqrt(A) * sqrt(Float64(Float64(1.0 / V) / l))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, A, V, l)
	tmp = 0.0;
	if ((l * V) <= -5e+293)
		tmp = c0 / sqrt((V * (l / A)));
	elseif ((l * V) <= -5e-305)
		tmp = c0 * (sqrt(-A) / sqrt((l * -V)));
	elseif ((l * V) <= 5e-271)
		tmp = c0 * sqrt(((A / V) / l));
	else
		tmp = c0 * (sqrt(A) * sqrt(((1.0 / V) / l)));
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, A_, V_, l_] := If[LessEqual[N[(l * V), $MachinePrecision], -5e+293], N[(c0 / N[Sqrt[N[(V * N[(l / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -5e-305], N[(c0 * N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[(l * (-V)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 5e-271], N[(c0 * N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] * N[Sqrt[N[(N[(1.0 / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 2: 77.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := c0 \cdot \sqrt{\frac{A}{\ell \cdot V}}\\ \mathbf{if}\;t_0 \leq 0:\\ \;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{\ell}}{V}}\\ \mathbf{elif}\;t_0 \leq 2 \cdot 10^{+294}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot {\left(V \cdot \frac{\ell}{A}\right)}^{-0.5}\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 A V l)
 :precision binary64
 (let* ((t_0 (* c0 (sqrt (/ A (* l V))))))
   (if (<= t_0 0.0)
     (* c0 (sqrt (/ (/ A l) V)))
     (if (<= t_0 2e+294) t_0 (* c0 (pow (* V (/ l A)) -0.5))))))

C

double code(double c0, double A, double V, double l) {
	double t_0 = c0 * sqrt((A / (l * V)));
	double tmp;
	if (t_0 <= 0.0) {
		tmp = c0 * sqrt(((A / l) / V));
	} else if (t_0 <= 2e+294) {
		tmp = t_0;
	} else {
		tmp = c0 * pow((V * (l / A)), -0.5);
	}
	return tmp;
}

Fortran

real(8) function code(c0, a, v, l)
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    real(8) :: t_0
    real(8) :: tmp
    t_0 = c0 * sqrt((a / (l * v)))
    if (t_0 <= 0.0d0) then
        tmp = c0 * sqrt(((a / l) / v))
    else if (t_0 <= 2d+294) then
        tmp = t_0
    else
        tmp = c0 * ((v * (l / a)) ** (-0.5d0))
    end if
    code = tmp
end function

Java

public static double code(double c0, double A, double V, double l) {
	double t_0 = c0 * Math.sqrt((A / (l * V)));
	double tmp;
	if (t_0 <= 0.0) {
		tmp = c0 * Math.sqrt(((A / l) / V));
	} else if (t_0 <= 2e+294) {
		tmp = t_0;
	} else {
		tmp = c0 * Math.pow((V * (l / A)), -0.5);
	}
	return tmp;
}

Python

def code(c0, A, V, l):
	t_0 = c0 * math.sqrt((A / (l * V)))
	tmp = 0
	if t_0 <= 0.0:
		tmp = c0 * math.sqrt(((A / l) / V))
	elif t_0 <= 2e+294:
		tmp = t_0
	else:
		tmp = c0 * math.pow((V * (l / A)), -0.5)
	return tmp

Julia

function code(c0, A, V, l)
	t_0 = Float64(c0 * sqrt(Float64(A / Float64(l * V))))
	tmp = 0.0
	if (t_0 <= 0.0)
		tmp = Float64(c0 * sqrt(Float64(Float64(A / l) / V)));
	elseif (t_0 <= 2e+294)
		tmp = t_0;
	else
		tmp = Float64(c0 * (Float64(V * Float64(l / A)) ^ -0.5));
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, A, V, l)
	t_0 = c0 * sqrt((A / (l * V)));
	tmp = 0.0;
	if (t_0 <= 0.0)
		tmp = c0 * sqrt(((A / l) / V));
	elseif (t_0 <= 2e+294)
		tmp = t_0;
	else
		tmp = c0 * ((V * (l / A)) ^ -0.5);
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(c0 * N[Sqrt[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(c0 * N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2e+294], t$95$0, N[(c0 * N[Power[N[(V * N[(l / A), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 3: 77.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{A}{\ell \cdot V}\\ t_1 := c0 \cdot \sqrt{t_0}\\ \mathbf{if}\;t_1 \leq 0:\\ \;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{\ell}}{V}}\\ \mathbf{elif}\;t_1 \leq 2 \cdot 10^{+294}:\\ \;\;\;\;c0 \cdot {t_0}^{0.5}\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot {\left(V \cdot \frac{\ell}{A}\right)}^{-0.5}\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 A V l)
 :precision binary64
 (let* ((t_0 (/ A (* l V))) (t_1 (* c0 (sqrt t_0))))
   (if (<= t_1 0.0)
     (* c0 (sqrt (/ (/ A l) V)))
     (if (<= t_1 2e+294)
       (* c0 (pow t_0 0.5))
       (* c0 (pow (* V (/ l A)) -0.5))))))

C

double code(double c0, double A, double V, double l) {
	double t_0 = A / (l * V);
	double t_1 = c0 * sqrt(t_0);
	double tmp;
	if (t_1 <= 0.0) {
		tmp = c0 * sqrt(((A / l) / V));
	} else if (t_1 <= 2e+294) {
		tmp = c0 * pow(t_0, 0.5);
	} else {
		tmp = c0 * pow((V * (l / A)), -0.5);
	}
	return tmp;
}

Fortran

real(8) function code(c0, a, v, l)
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = a / (l * v)
    t_1 = c0 * sqrt(t_0)
    if (t_1 <= 0.0d0) then
        tmp = c0 * sqrt(((a / l) / v))
    else if (t_1 <= 2d+294) then
        tmp = c0 * (t_0 ** 0.5d0)
    else
        tmp = c0 * ((v * (l / a)) ** (-0.5d0))
    end if
    code = tmp
end function

Java

public static double code(double c0, double A, double V, double l) {
	double t_0 = A / (l * V);
	double t_1 = c0 * Math.sqrt(t_0);
	double tmp;
	if (t_1 <= 0.0) {
		tmp = c0 * Math.sqrt(((A / l) / V));
	} else if (t_1 <= 2e+294) {
		tmp = c0 * Math.pow(t_0, 0.5);
	} else {
		tmp = c0 * Math.pow((V * (l / A)), -0.5);
	}
	return tmp;
}

Python

def code(c0, A, V, l):
	t_0 = A / (l * V)
	t_1 = c0 * math.sqrt(t_0)
	tmp = 0
	if t_1 <= 0.0:
		tmp = c0 * math.sqrt(((A / l) / V))
	elif t_1 <= 2e+294:
		tmp = c0 * math.pow(t_0, 0.5)
	else:
		tmp = c0 * math.pow((V * (l / A)), -0.5)
	return tmp

Julia

function code(c0, A, V, l)
	t_0 = Float64(A / Float64(l * V))
	t_1 = Float64(c0 * sqrt(t_0))
	tmp = 0.0
	if (t_1 <= 0.0)
		tmp = Float64(c0 * sqrt(Float64(Float64(A / l) / V)));
	elseif (t_1 <= 2e+294)
		tmp = Float64(c0 * (t_0 ^ 0.5));
	else
		tmp = Float64(c0 * (Float64(V * Float64(l / A)) ^ -0.5));
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, A, V, l)
	t_0 = A / (l * V);
	t_1 = c0 * sqrt(t_0);
	tmp = 0.0;
	if (t_1 <= 0.0)
		tmp = c0 * sqrt(((A / l) / V));
	elseif (t_1 <= 2e+294)
		tmp = c0 * (t_0 ^ 0.5);
	else
		tmp = c0 * ((V * (l / A)) ^ -0.5);
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(c0 * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 0.0], N[(c0 * N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+294], N[(c0 * N[Power[t$95$0, 0.5], $MachinePrecision]), $MachinePrecision], N[(c0 * N[Power[N[(V * N[(l / A), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 4: 77.0% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := c0 \cdot \sqrt{\frac{A}{\ell \cdot V}}\\ \mathbf{if}\;t_0 \leq 0 \lor \neg \left(t_0 \leq 2 \cdot 10^{+290}\right):\\ \;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{V}}{\ell}}\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 A V l)
 :precision binary64
 (let* ((t_0 (* c0 (sqrt (/ A (* l V))))))
   (if (or (<= t_0 0.0) (not (<= t_0 2e+290)))
     (* c0 (sqrt (/ (/ A V) l)))
     t_0)))

C

double code(double c0, double A, double V, double l) {
	double t_0 = c0 * sqrt((A / (l * V)));
	double tmp;
	if ((t_0 <= 0.0) || !(t_0 <= 2e+290)) {
		tmp = c0 * sqrt(((A / V) / l));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(c0, a, v, l)
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    real(8) :: t_0
    real(8) :: tmp
    t_0 = c0 * sqrt((a / (l * v)))
    if ((t_0 <= 0.0d0) .or. (.not. (t_0 <= 2d+290))) then
        tmp = c0 * sqrt(((a / v) / l))
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double c0, double A, double V, double l) {
	double t_0 = c0 * Math.sqrt((A / (l * V)));
	double tmp;
	if ((t_0 <= 0.0) || !(t_0 <= 2e+290)) {
		tmp = c0 * Math.sqrt(((A / V) / l));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(c0, A, V, l):
	t_0 = c0 * math.sqrt((A / (l * V)))
	tmp = 0
	if (t_0 <= 0.0) or not (t_0 <= 2e+290):
		tmp = c0 * math.sqrt(((A / V) / l))
	else:
		tmp = t_0
	return tmp

Julia

function code(c0, A, V, l)
	t_0 = Float64(c0 * sqrt(Float64(A / Float64(l * V))))
	tmp = 0.0
	if ((t_0 <= 0.0) || !(t_0 <= 2e+290))
		tmp = Float64(c0 * sqrt(Float64(Float64(A / V) / l)));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, A, V, l)
	t_0 = c0 * sqrt((A / (l * V)));
	tmp = 0.0;
	if ((t_0 <= 0.0) || ~((t_0 <= 2e+290)))
		tmp = c0 * sqrt(((A / V) / l));
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(c0 * N[Sqrt[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, 0.0], N[Not[LessEqual[t$95$0, 2e+290]], $MachinePrecision]], N[(c0 * N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], t$95$0]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 5: 76.9% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := c0 \cdot \sqrt{\frac{A}{\ell \cdot V}}\\ \mathbf{if}\;t_0 \leq 0:\\ \;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{\ell}}{V}}\\ \mathbf{elif}\;t_0 \leq 2 \cdot 10^{+290}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{V}}{\ell}}\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 A V l)
 :precision binary64
 (let* ((t_0 (* c0 (sqrt (/ A (* l V))))))
   (if (<= t_0 0.0)
     (* c0 (sqrt (/ (/ A l) V)))
     (if (<= t_0 2e+290) t_0 (* c0 (sqrt (/ (/ A V) l)))))))

C

double code(double c0, double A, double V, double l) {
	double t_0 = c0 * sqrt((A / (l * V)));
	double tmp;
	if (t_0 <= 0.0) {
		tmp = c0 * sqrt(((A / l) / V));
	} else if (t_0 <= 2e+290) {
		tmp = t_0;
	} else {
		tmp = c0 * sqrt(((A / V) / l));
	}
	return tmp;
}

Fortran

real(8) function code(c0, a, v, l)
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    real(8) :: t_0
    real(8) :: tmp
    t_0 = c0 * sqrt((a / (l * v)))
    if (t_0 <= 0.0d0) then
        tmp = c0 * sqrt(((a / l) / v))
    else if (t_0 <= 2d+290) then
        tmp = t_0
    else
        tmp = c0 * sqrt(((a / v) / l))
    end if
    code = tmp
end function

Java

public static double code(double c0, double A, double V, double l) {
	double t_0 = c0 * Math.sqrt((A / (l * V)));
	double tmp;
	if (t_0 <= 0.0) {
		tmp = c0 * Math.sqrt(((A / l) / V));
	} else if (t_0 <= 2e+290) {
		tmp = t_0;
	} else {
		tmp = c0 * Math.sqrt(((A / V) / l));
	}
	return tmp;
}

Python

def code(c0, A, V, l):
	t_0 = c0 * math.sqrt((A / (l * V)))
	tmp = 0
	if t_0 <= 0.0:
		tmp = c0 * math.sqrt(((A / l) / V))
	elif t_0 <= 2e+290:
		tmp = t_0
	else:
		tmp = c0 * math.sqrt(((A / V) / l))
	return tmp

Julia

function code(c0, A, V, l)
	t_0 = Float64(c0 * sqrt(Float64(A / Float64(l * V))))
	tmp = 0.0
	if (t_0 <= 0.0)
		tmp = Float64(c0 * sqrt(Float64(Float64(A / l) / V)));
	elseif (t_0 <= 2e+290)
		tmp = t_0;
	else
		tmp = Float64(c0 * sqrt(Float64(Float64(A / V) / l)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, A, V, l)
	t_0 = c0 * sqrt((A / (l * V)));
	tmp = 0.0;
	if (t_0 <= 0.0)
		tmp = c0 * sqrt(((A / l) / V));
	elseif (t_0 <= 2e+290)
		tmp = t_0;
	else
		tmp = c0 * sqrt(((A / V) / l));
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(c0 * N[Sqrt[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(c0 * N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2e+290], t$95$0, N[(c0 * N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 6: 77.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := c0 \cdot \sqrt{\frac{A}{\ell \cdot V}}\\ \mathbf{if}\;t_0 \leq 0:\\ \;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{\ell}}{V}}\\ \mathbf{elif}\;t_0 \leq 2 \cdot 10^{+294}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;\frac{c0}{\sqrt{V \cdot \frac{\ell}{A}}}\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 A V l)
 :precision binary64
 (let* ((t_0 (* c0 (sqrt (/ A (* l V))))))
   (if (<= t_0 0.0)
     (* c0 (sqrt (/ (/ A l) V)))
     (if (<= t_0 2e+294) t_0 (/ c0 (sqrt (* V (/ l A))))))))

C

double code(double c0, double A, double V, double l) {
	double t_0 = c0 * sqrt((A / (l * V)));
	double tmp;
	if (t_0 <= 0.0) {
		tmp = c0 * sqrt(((A / l) / V));
	} else if (t_0 <= 2e+294) {
		tmp = t_0;
	} else {
		tmp = c0 / sqrt((V * (l / A)));
	}
	return tmp;
}

Fortran

real(8) function code(c0, a, v, l)
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    real(8) :: t_0
    real(8) :: tmp
    t_0 = c0 * sqrt((a / (l * v)))
    if (t_0 <= 0.0d0) then
        tmp = c0 * sqrt(((a / l) / v))
    else if (t_0 <= 2d+294) then
        tmp = t_0
    else
        tmp = c0 / sqrt((v * (l / a)))
    end if
    code = tmp
end function

Java

public static double code(double c0, double A, double V, double l) {
	double t_0 = c0 * Math.sqrt((A / (l * V)));
	double tmp;
	if (t_0 <= 0.0) {
		tmp = c0 * Math.sqrt(((A / l) / V));
	} else if (t_0 <= 2e+294) {
		tmp = t_0;
	} else {
		tmp = c0 / Math.sqrt((V * (l / A)));
	}
	return tmp;
}

Python

def code(c0, A, V, l):
	t_0 = c0 * math.sqrt((A / (l * V)))
	tmp = 0
	if t_0 <= 0.0:
		tmp = c0 * math.sqrt(((A / l) / V))
	elif t_0 <= 2e+294:
		tmp = t_0
	else:
		tmp = c0 / math.sqrt((V * (l / A)))
	return tmp

Julia

function code(c0, A, V, l)
	t_0 = Float64(c0 * sqrt(Float64(A / Float64(l * V))))
	tmp = 0.0
	if (t_0 <= 0.0)
		tmp = Float64(c0 * sqrt(Float64(Float64(A / l) / V)));
	elseif (t_0 <= 2e+294)
		tmp = t_0;
	else
		tmp = Float64(c0 / sqrt(Float64(V * Float64(l / A))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, A, V, l)
	t_0 = c0 * sqrt((A / (l * V)));
	tmp = 0.0;
	if (t_0 <= 0.0)
		tmp = c0 * sqrt(((A / l) / V));
	elseif (t_0 <= 2e+294)
		tmp = t_0;
	else
		tmp = c0 / sqrt((V * (l / A)));
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(c0 * N[Sqrt[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(c0 * N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2e+294], t$95$0, N[(c0 / N[Sqrt[N[(V * N[(l / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 7: 77.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := c0 \cdot \sqrt{\frac{A}{\ell \cdot V}}\\ \mathbf{if}\;t_0 \leq 0:\\ \;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{\ell}}{V}}\\ \mathbf{elif}\;t_0 \leq 2 \cdot 10^{+290}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;\frac{c0}{\sqrt{\frac{\ell}{\frac{A}{V}}}}\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 A V l)
 :precision binary64
 (let* ((t_0 (* c0 (sqrt (/ A (* l V))))))
   (if (<= t_0 0.0)
     (* c0 (sqrt (/ (/ A l) V)))
     (if (<= t_0 2e+290) t_0 (/ c0 (sqrt (/ l (/ A V))))))))

C

double code(double c0, double A, double V, double l) {
	double t_0 = c0 * sqrt((A / (l * V)));
	double tmp;
	if (t_0 <= 0.0) {
		tmp = c0 * sqrt(((A / l) / V));
	} else if (t_0 <= 2e+290) {
		tmp = t_0;
	} else {
		tmp = c0 / sqrt((l / (A / V)));
	}
	return tmp;
}

Fortran

real(8) function code(c0, a, v, l)
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    real(8) :: t_0
    real(8) :: tmp
    t_0 = c0 * sqrt((a / (l * v)))
    if (t_0 <= 0.0d0) then
        tmp = c0 * sqrt(((a / l) / v))
    else if (t_0 <= 2d+290) then
        tmp = t_0
    else
        tmp = c0 / sqrt((l / (a / v)))
    end if
    code = tmp
end function

Java

public static double code(double c0, double A, double V, double l) {
	double t_0 = c0 * Math.sqrt((A / (l * V)));
	double tmp;
	if (t_0 <= 0.0) {
		tmp = c0 * Math.sqrt(((A / l) / V));
	} else if (t_0 <= 2e+290) {
		tmp = t_0;
	} else {
		tmp = c0 / Math.sqrt((l / (A / V)));
	}
	return tmp;
}

Python

def code(c0, A, V, l):
	t_0 = c0 * math.sqrt((A / (l * V)))
	tmp = 0
	if t_0 <= 0.0:
		tmp = c0 * math.sqrt(((A / l) / V))
	elif t_0 <= 2e+290:
		tmp = t_0
	else:
		tmp = c0 / math.sqrt((l / (A / V)))
	return tmp

Julia

function code(c0, A, V, l)
	t_0 = Float64(c0 * sqrt(Float64(A / Float64(l * V))))
	tmp = 0.0
	if (t_0 <= 0.0)
		tmp = Float64(c0 * sqrt(Float64(Float64(A / l) / V)));
	elseif (t_0 <= 2e+290)
		tmp = t_0;
	else
		tmp = Float64(c0 / sqrt(Float64(l / Float64(A / V))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, A, V, l)
	t_0 = c0 * sqrt((A / (l * V)));
	tmp = 0.0;
	if (t_0 <= 0.0)
		tmp = c0 * sqrt(((A / l) / V));
	elseif (t_0 <= 2e+290)
		tmp = t_0;
	else
		tmp = c0 / sqrt((l / (A / V)));
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(c0 * N[Sqrt[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(c0 * N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2e+290], t$95$0, N[(c0 / N[Sqrt[N[(l / N[(A / V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 8: 66.0% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;A \leq -1 \cdot 10^{-310}:\\ \;\;\;\;\frac{c0}{\frac{\sqrt{\ell}}{\frac{\sqrt{-A}}{\sqrt{-V}}}}\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{\ell \cdot V}}\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 A V l)
 :precision binary64
 (if (<= A -1e-310)
   (/ c0 (/ (sqrt l) (/ (sqrt (- A)) (sqrt (- V)))))
   (* c0 (/ (sqrt A) (sqrt (* l V))))))

C

double code(double c0, double A, double V, double l) {
	double tmp;
	if (A <= -1e-310) {
		tmp = c0 / (sqrt(l) / (sqrt(-A) / sqrt(-V)));
	} else {
		tmp = c0 * (sqrt(A) / sqrt((l * V)));
	}
	return tmp;
}

Fortran

real(8) function code(c0, a, v, l)
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    real(8) :: tmp
    if (a <= (-1d-310)) then
        tmp = c0 / (sqrt(l) / (sqrt(-a) / sqrt(-v)))
    else
        tmp = c0 * (sqrt(a) / sqrt((l * v)))
    end if
    code = tmp
end function

Java

public static double code(double c0, double A, double V, double l) {
	double tmp;
	if (A <= -1e-310) {
		tmp = c0 / (Math.sqrt(l) / (Math.sqrt(-A) / Math.sqrt(-V)));
	} else {
		tmp = c0 * (Math.sqrt(A) / Math.sqrt((l * V)));
	}
	return tmp;
}

Python

def code(c0, A, V, l):
	tmp = 0
	if A <= -1e-310:
		tmp = c0 / (math.sqrt(l) / (math.sqrt(-A) / math.sqrt(-V)))
	else:
		tmp = c0 * (math.sqrt(A) / math.sqrt((l * V)))
	return tmp

Julia

function code(c0, A, V, l)
	tmp = 0.0
	if (A <= -1e-310)
		tmp = Float64(c0 / Float64(sqrt(l) / Float64(sqrt(Float64(-A)) / sqrt(Float64(-V)))));
	else
		tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(l * V))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, A, V, l)
	tmp = 0.0;
	if (A <= -1e-310)
		tmp = c0 / (sqrt(l) / (sqrt(-A) / sqrt(-V)));
	else
		tmp = c0 * (sqrt(A) / sqrt((l * V)));
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, A_, V_, l_] := If[LessEqual[A, -1e-310], N[(c0 / N[(N[Sqrt[l], $MachinePrecision] / N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[(-V)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 9: 79.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\ell \cdot V \leq -5 \cdot 10^{+164}:\\ \;\;\;\;\frac{c0}{\frac{\sqrt{\ell}}{\sqrt{\frac{A}{V}}}}\\ \mathbf{elif}\;\ell \cdot V \leq -2 \cdot 10^{-173}:\\ \;\;\;\;c0 \cdot {\left(\frac{A}{\ell \cdot V}\right)}^{0.5}\\ \mathbf{elif}\;\ell \cdot V \leq 5 \cdot 10^{-271}:\\ \;\;\;\;c0 \cdot {\left(V \cdot \frac{\ell}{A}\right)}^{-0.5}\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \left(\sqrt{A} \cdot \sqrt{\frac{\frac{1}{V}}{\ell}}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 A V l)
 :precision binary64
 (if (<= (* l V) -5e+164)
   (/ c0 (/ (sqrt l) (sqrt (/ A V))))
   (if (<= (* l V) -2e-173)
     (* c0 (pow (/ A (* l V)) 0.5))
     (if (<= (* l V) 5e-271)
       (* c0 (pow (* V (/ l A)) -0.5))
       (* c0 (* (sqrt A) (sqrt (/ (/ 1.0 V) l))))))))

C

double code(double c0, double A, double V, double l) {
	double tmp;
	if ((l * V) <= -5e+164) {
		tmp = c0 / (sqrt(l) / sqrt((A / V)));
	} else if ((l * V) <= -2e-173) {
		tmp = c0 * pow((A / (l * V)), 0.5);
	} else if ((l * V) <= 5e-271) {
		tmp = c0 * pow((V * (l / A)), -0.5);
	} else {
		tmp = c0 * (sqrt(A) * sqrt(((1.0 / V) / l)));
	}
	return tmp;
}

Fortran

real(8) function code(c0, a, v, l)
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    real(8) :: tmp
    if ((l * v) <= (-5d+164)) then
        tmp = c0 / (sqrt(l) / sqrt((a / v)))
    else if ((l * v) <= (-2d-173)) then
        tmp = c0 * ((a / (l * v)) ** 0.5d0)
    else if ((l * v) <= 5d-271) then
        tmp = c0 * ((v * (l / a)) ** (-0.5d0))
    else
        tmp = c0 * (sqrt(a) * sqrt(((1.0d0 / v) / l)))
    end if
    code = tmp
end function

Java

public static double code(double c0, double A, double V, double l) {
	double tmp;
	if ((l * V) <= -5e+164) {
		tmp = c0 / (Math.sqrt(l) / Math.sqrt((A / V)));
	} else if ((l * V) <= -2e-173) {
		tmp = c0 * Math.pow((A / (l * V)), 0.5);
	} else if ((l * V) <= 5e-271) {
		tmp = c0 * Math.pow((V * (l / A)), -0.5);
	} else {
		tmp = c0 * (Math.sqrt(A) * Math.sqrt(((1.0 / V) / l)));
	}
	return tmp;
}

Python

def code(c0, A, V, l):
	tmp = 0
	if (l * V) <= -5e+164:
		tmp = c0 / (math.sqrt(l) / math.sqrt((A / V)))
	elif (l * V) <= -2e-173:
		tmp = c0 * math.pow((A / (l * V)), 0.5)
	elif (l * V) <= 5e-271:
		tmp = c0 * math.pow((V * (l / A)), -0.5)
	else:
		tmp = c0 * (math.sqrt(A) * math.sqrt(((1.0 / V) / l)))
	return tmp

Julia

function code(c0, A, V, l)
	tmp = 0.0
	if (Float64(l * V) <= -5e+164)
		tmp = Float64(c0 / Float64(sqrt(l) / sqrt(Float64(A / V))));
	elseif (Float64(l * V) <= -2e-173)
		tmp = Float64(c0 * (Float64(A / Float64(l * V)) ^ 0.5));
	elseif (Float64(l * V) <= 5e-271)
		tmp = Float64(c0 * (Float64(V * Float64(l / A)) ^ -0.5));
	else
		tmp = Float64(c0 * Float64(sqrt(A) * sqrt(Float64(Float64(1.0 / V) / l))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, A, V, l)
	tmp = 0.0;
	if ((l * V) <= -5e+164)
		tmp = c0 / (sqrt(l) / sqrt((A / V)));
	elseif ((l * V) <= -2e-173)
		tmp = c0 * ((A / (l * V)) ^ 0.5);
	elseif ((l * V) <= 5e-271)
		tmp = c0 * ((V * (l / A)) ^ -0.5);
	else
		tmp = c0 * (sqrt(A) * sqrt(((1.0 / V) / l)));
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, A_, V_, l_] := If[LessEqual[N[(l * V), $MachinePrecision], -5e+164], N[(c0 / N[(N[Sqrt[l], $MachinePrecision] / N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -2e-173], N[(c0 * N[Power[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 5e-271], N[(c0 * N[Power[N[(V * N[(l / A), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] * N[Sqrt[N[(N[(1.0 / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 10: 80.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := V \cdot \frac{\ell}{A}\\ \mathbf{if}\;\ell \cdot V \leq -2 \cdot 10^{+121}:\\ \;\;\;\;\frac{c0}{\sqrt{t_0}}\\ \mathbf{elif}\;\ell \cdot V \leq -2 \cdot 10^{-173}:\\ \;\;\;\;c0 \cdot {\left(\frac{A}{\ell \cdot V}\right)}^{0.5}\\ \mathbf{elif}\;\ell \cdot V \leq 2 \cdot 10^{-221}:\\ \;\;\;\;c0 \cdot {t_0}^{-0.5}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{A} \cdot \frac{c0}{\sqrt{\ell \cdot V}}\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 A V l)
 :precision binary64
 (let* ((t_0 (* V (/ l A))))
   (if (<= (* l V) -2e+121)
     (/ c0 (sqrt t_0))
     (if (<= (* l V) -2e-173)
       (* c0 (pow (/ A (* l V)) 0.5))
       (if (<= (* l V) 2e-221)
         (* c0 (pow t_0 -0.5))
         (* (sqrt A) (/ c0 (sqrt (* l V)))))))))

C

double code(double c0, double A, double V, double l) {
	double t_0 = V * (l / A);
	double tmp;
	if ((l * V) <= -2e+121) {
		tmp = c0 / sqrt(t_0);
	} else if ((l * V) <= -2e-173) {
		tmp = c0 * pow((A / (l * V)), 0.5);
	} else if ((l * V) <= 2e-221) {
		tmp = c0 * pow(t_0, -0.5);
	} else {
		tmp = sqrt(A) * (c0 / sqrt((l * V)));
	}
	return tmp;
}

Fortran

real(8) function code(c0, a, v, l)
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    real(8) :: t_0
    real(8) :: tmp
    t_0 = v * (l / a)
    if ((l * v) <= (-2d+121)) then
        tmp = c0 / sqrt(t_0)
    else if ((l * v) <= (-2d-173)) then
        tmp = c0 * ((a / (l * v)) ** 0.5d0)
    else if ((l * v) <= 2d-221) then
        tmp = c0 * (t_0 ** (-0.5d0))
    else
        tmp = sqrt(a) * (c0 / sqrt((l * v)))
    end if
    code = tmp
end function

Java

public static double code(double c0, double A, double V, double l) {
	double t_0 = V * (l / A);
	double tmp;
	if ((l * V) <= -2e+121) {
		tmp = c0 / Math.sqrt(t_0);
	} else if ((l * V) <= -2e-173) {
		tmp = c0 * Math.pow((A / (l * V)), 0.5);
	} else if ((l * V) <= 2e-221) {
		tmp = c0 * Math.pow(t_0, -0.5);
	} else {
		tmp = Math.sqrt(A) * (c0 / Math.sqrt((l * V)));
	}
	return tmp;
}

Python

def code(c0, A, V, l):
	t_0 = V * (l / A)
	tmp = 0
	if (l * V) <= -2e+121:
		tmp = c0 / math.sqrt(t_0)
	elif (l * V) <= -2e-173:
		tmp = c0 * math.pow((A / (l * V)), 0.5)
	elif (l * V) <= 2e-221:
		tmp = c0 * math.pow(t_0, -0.5)
	else:
		tmp = math.sqrt(A) * (c0 / math.sqrt((l * V)))
	return tmp

Julia

function code(c0, A, V, l)
	t_0 = Float64(V * Float64(l / A))
	tmp = 0.0
	if (Float64(l * V) <= -2e+121)
		tmp = Float64(c0 / sqrt(t_0));
	elseif (Float64(l * V) <= -2e-173)
		tmp = Float64(c0 * (Float64(A / Float64(l * V)) ^ 0.5));
	elseif (Float64(l * V) <= 2e-221)
		tmp = Float64(c0 * (t_0 ^ -0.5));
	else
		tmp = Float64(sqrt(A) * Float64(c0 / sqrt(Float64(l * V))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, A, V, l)
	t_0 = V * (l / A);
	tmp = 0.0;
	if ((l * V) <= -2e+121)
		tmp = c0 / sqrt(t_0);
	elseif ((l * V) <= -2e-173)
		tmp = c0 * ((A / (l * V)) ^ 0.5);
	elseif ((l * V) <= 2e-221)
		tmp = c0 * (t_0 ^ -0.5);
	else
		tmp = sqrt(A) * (c0 / sqrt((l * V)));
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(V * N[(l / A), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(l * V), $MachinePrecision], -2e+121], N[(c0 / N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -2e-173], N[(c0 * N[Power[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 2e-221], N[(c0 * N[Power[t$95$0, -0.5], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[A], $MachinePrecision] * N[(c0 / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 11: 82.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := V \cdot \frac{\ell}{A}\\ \mathbf{if}\;\ell \cdot V \leq -2 \cdot 10^{+121}:\\ \;\;\;\;\frac{c0}{\sqrt{t_0}}\\ \mathbf{elif}\;\ell \cdot V \leq -2 \cdot 10^{-173}:\\ \;\;\;\;c0 \cdot {\left(\frac{A}{\ell \cdot V}\right)}^{0.5}\\ \mathbf{elif}\;\ell \cdot V \leq 2 \cdot 10^{-270}:\\ \;\;\;\;c0 \cdot {t_0}^{-0.5}\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{\ell \cdot V}}\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 A V l)
 :precision binary64
 (let* ((t_0 (* V (/ l A))))
   (if (<= (* l V) -2e+121)
     (/ c0 (sqrt t_0))
     (if (<= (* l V) -2e-173)
       (* c0 (pow (/ A (* l V)) 0.5))
       (if (<= (* l V) 2e-270)
         (* c0 (pow t_0 -0.5))
         (* c0 (/ (sqrt A) (sqrt (* l V)))))))))

C

double code(double c0, double A, double V, double l) {
	double t_0 = V * (l / A);
	double tmp;
	if ((l * V) <= -2e+121) {
		tmp = c0 / sqrt(t_0);
	} else if ((l * V) <= -2e-173) {
		tmp = c0 * pow((A / (l * V)), 0.5);
	} else if ((l * V) <= 2e-270) {
		tmp = c0 * pow(t_0, -0.5);
	} else {
		tmp = c0 * (sqrt(A) / sqrt((l * V)));
	}
	return tmp;
}

Fortran

real(8) function code(c0, a, v, l)
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    real(8) :: t_0
    real(8) :: tmp
    t_0 = v * (l / a)
    if ((l * v) <= (-2d+121)) then
        tmp = c0 / sqrt(t_0)
    else if ((l * v) <= (-2d-173)) then
        tmp = c0 * ((a / (l * v)) ** 0.5d0)
    else if ((l * v) <= 2d-270) then
        tmp = c0 * (t_0 ** (-0.5d0))
    else
        tmp = c0 * (sqrt(a) / sqrt((l * v)))
    end if
    code = tmp
end function

Java

public static double code(double c0, double A, double V, double l) {
	double t_0 = V * (l / A);
	double tmp;
	if ((l * V) <= -2e+121) {
		tmp = c0 / Math.sqrt(t_0);
	} else if ((l * V) <= -2e-173) {
		tmp = c0 * Math.pow((A / (l * V)), 0.5);
	} else if ((l * V) <= 2e-270) {
		tmp = c0 * Math.pow(t_0, -0.5);
	} else {
		tmp = c0 * (Math.sqrt(A) / Math.sqrt((l * V)));
	}
	return tmp;
}

Python

def code(c0, A, V, l):
	t_0 = V * (l / A)
	tmp = 0
	if (l * V) <= -2e+121:
		tmp = c0 / math.sqrt(t_0)
	elif (l * V) <= -2e-173:
		tmp = c0 * math.pow((A / (l * V)), 0.5)
	elif (l * V) <= 2e-270:
		tmp = c0 * math.pow(t_0, -0.5)
	else:
		tmp = c0 * (math.sqrt(A) / math.sqrt((l * V)))
	return tmp

Julia

function code(c0, A, V, l)
	t_0 = Float64(V * Float64(l / A))
	tmp = 0.0
	if (Float64(l * V) <= -2e+121)
		tmp = Float64(c0 / sqrt(t_0));
	elseif (Float64(l * V) <= -2e-173)
		tmp = Float64(c0 * (Float64(A / Float64(l * V)) ^ 0.5));
	elseif (Float64(l * V) <= 2e-270)
		tmp = Float64(c0 * (t_0 ^ -0.5));
	else
		tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(l * V))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, A, V, l)
	t_0 = V * (l / A);
	tmp = 0.0;
	if ((l * V) <= -2e+121)
		tmp = c0 / sqrt(t_0);
	elseif ((l * V) <= -2e-173)
		tmp = c0 * ((A / (l * V)) ^ 0.5);
	elseif ((l * V) <= 2e-270)
		tmp = c0 * (t_0 ^ -0.5);
	else
		tmp = c0 * (sqrt(A) / sqrt((l * V)));
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(V * N[(l / A), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(l * V), $MachinePrecision], -2e+121], N[(c0 / N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -2e-173], N[(c0 * N[Power[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 2e-270], N[(c0 * N[Power[t$95$0, -0.5], $MachinePrecision]), $MachinePrecision], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 12: 79.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\ell \cdot V \leq -2 \cdot 10^{+180}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{\frac{A}{V}}}{\sqrt{\ell}}\\ \mathbf{elif}\;\ell \cdot V \leq -2 \cdot 10^{-173}:\\ \;\;\;\;c0 \cdot {\left(\frac{A}{\ell \cdot V}\right)}^{0.5}\\ \mathbf{elif}\;\ell \cdot V \leq 2 \cdot 10^{-270}:\\ \;\;\;\;c0 \cdot {\left(V \cdot \frac{\ell}{A}\right)}^{-0.5}\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{\ell \cdot V}}\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 A V l)
 :precision binary64
 (if (<= (* l V) -2e+180)
   (* c0 (/ (sqrt (/ A V)) (sqrt l)))
   (if (<= (* l V) -2e-173)
     (* c0 (pow (/ A (* l V)) 0.5))
     (if (<= (* l V) 2e-270)
       (* c0 (pow (* V (/ l A)) -0.5))
       (* c0 (/ (sqrt A) (sqrt (* l V))))))))

C

double code(double c0, double A, double V, double l) {
	double tmp;
	if ((l * V) <= -2e+180) {
		tmp = c0 * (sqrt((A / V)) / sqrt(l));
	} else if ((l * V) <= -2e-173) {
		tmp = c0 * pow((A / (l * V)), 0.5);
	} else if ((l * V) <= 2e-270) {
		tmp = c0 * pow((V * (l / A)), -0.5);
	} else {
		tmp = c0 * (sqrt(A) / sqrt((l * V)));
	}
	return tmp;
}

Fortran

real(8) function code(c0, a, v, l)
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    real(8) :: tmp
    if ((l * v) <= (-2d+180)) then
        tmp = c0 * (sqrt((a / v)) / sqrt(l))
    else if ((l * v) <= (-2d-173)) then
        tmp = c0 * ((a / (l * v)) ** 0.5d0)
    else if ((l * v) <= 2d-270) then
        tmp = c0 * ((v * (l / a)) ** (-0.5d0))
    else
        tmp = c0 * (sqrt(a) / sqrt((l * v)))
    end if
    code = tmp
end function

Java

public static double code(double c0, double A, double V, double l) {
	double tmp;
	if ((l * V) <= -2e+180) {
		tmp = c0 * (Math.sqrt((A / V)) / Math.sqrt(l));
	} else if ((l * V) <= -2e-173) {
		tmp = c0 * Math.pow((A / (l * V)), 0.5);
	} else if ((l * V) <= 2e-270) {
		tmp = c0 * Math.pow((V * (l / A)), -0.5);
	} else {
		tmp = c0 * (Math.sqrt(A) / Math.sqrt((l * V)));
	}
	return tmp;
}

Python

def code(c0, A, V, l):
	tmp = 0
	if (l * V) <= -2e+180:
		tmp = c0 * (math.sqrt((A / V)) / math.sqrt(l))
	elif (l * V) <= -2e-173:
		tmp = c0 * math.pow((A / (l * V)), 0.5)
	elif (l * V) <= 2e-270:
		tmp = c0 * math.pow((V * (l / A)), -0.5)
	else:
		tmp = c0 * (math.sqrt(A) / math.sqrt((l * V)))
	return tmp

Julia

function code(c0, A, V, l)
	tmp = 0.0
	if (Float64(l * V) <= -2e+180)
		tmp = Float64(c0 * Float64(sqrt(Float64(A / V)) / sqrt(l)));
	elseif (Float64(l * V) <= -2e-173)
		tmp = Float64(c0 * (Float64(A / Float64(l * V)) ^ 0.5));
	elseif (Float64(l * V) <= 2e-270)
		tmp = Float64(c0 * (Float64(V * Float64(l / A)) ^ -0.5));
	else
		tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(l * V))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, A, V, l)
	tmp = 0.0;
	if ((l * V) <= -2e+180)
		tmp = c0 * (sqrt((A / V)) / sqrt(l));
	elseif ((l * V) <= -2e-173)
		tmp = c0 * ((A / (l * V)) ^ 0.5);
	elseif ((l * V) <= 2e-270)
		tmp = c0 * ((V * (l / A)) ^ -0.5);
	else
		tmp = c0 * (sqrt(A) / sqrt((l * V)));
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, A_, V_, l_] := If[LessEqual[N[(l * V), $MachinePrecision], -2e+180], N[(c0 * N[(N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -2e-173], N[(c0 * N[Power[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 2e-270], N[(c0 * N[Power[N[(V * N[(l / A), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 13: 80.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\ell \cdot V \leq -2 \cdot 10^{+272}:\\ \;\;\;\;\frac{c0}{\sqrt{\ell} \cdot \sqrt{\frac{V}{A}}}\\ \mathbf{elif}\;\ell \cdot V \leq -2 \cdot 10^{-173}:\\ \;\;\;\;c0 \cdot {\left(\frac{A}{\ell \cdot V}\right)}^{0.5}\\ \mathbf{elif}\;\ell \cdot V \leq 2 \cdot 10^{-270}:\\ \;\;\;\;c0 \cdot {\left(V \cdot \frac{\ell}{A}\right)}^{-0.5}\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{\ell \cdot V}}\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 A V l)
 :precision binary64
 (if (<= (* l V) -2e+272)
   (/ c0 (* (sqrt l) (sqrt (/ V A))))
   (if (<= (* l V) -2e-173)
     (* c0 (pow (/ A (* l V)) 0.5))
     (if (<= (* l V) 2e-270)
       (* c0 (pow (* V (/ l A)) -0.5))
       (* c0 (/ (sqrt A) (sqrt (* l V))))))))

C

double code(double c0, double A, double V, double l) {
	double tmp;
	if ((l * V) <= -2e+272) {
		tmp = c0 / (sqrt(l) * sqrt((V / A)));
	} else if ((l * V) <= -2e-173) {
		tmp = c0 * pow((A / (l * V)), 0.5);
	} else if ((l * V) <= 2e-270) {
		tmp = c0 * pow((V * (l / A)), -0.5);
	} else {
		tmp = c0 * (sqrt(A) / sqrt((l * V)));
	}
	return tmp;
}

Fortran

real(8) function code(c0, a, v, l)
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    real(8) :: tmp
    if ((l * v) <= (-2d+272)) then
        tmp = c0 / (sqrt(l) * sqrt((v / a)))
    else if ((l * v) <= (-2d-173)) then
        tmp = c0 * ((a / (l * v)) ** 0.5d0)
    else if ((l * v) <= 2d-270) then
        tmp = c0 * ((v * (l / a)) ** (-0.5d0))
    else
        tmp = c0 * (sqrt(a) / sqrt((l * v)))
    end if
    code = tmp
end function

Java

public static double code(double c0, double A, double V, double l) {
	double tmp;
	if ((l * V) <= -2e+272) {
		tmp = c0 / (Math.sqrt(l) * Math.sqrt((V / A)));
	} else if ((l * V) <= -2e-173) {
		tmp = c0 * Math.pow((A / (l * V)), 0.5);
	} else if ((l * V) <= 2e-270) {
		tmp = c0 * Math.pow((V * (l / A)), -0.5);
	} else {
		tmp = c0 * (Math.sqrt(A) / Math.sqrt((l * V)));
	}
	return tmp;
}

Python

def code(c0, A, V, l):
	tmp = 0
	if (l * V) <= -2e+272:
		tmp = c0 / (math.sqrt(l) * math.sqrt((V / A)))
	elif (l * V) <= -2e-173:
		tmp = c0 * math.pow((A / (l * V)), 0.5)
	elif (l * V) <= 2e-270:
		tmp = c0 * math.pow((V * (l / A)), -0.5)
	else:
		tmp = c0 * (math.sqrt(A) / math.sqrt((l * V)))
	return tmp

Julia

function code(c0, A, V, l)
	tmp = 0.0
	if (Float64(l * V) <= -2e+272)
		tmp = Float64(c0 / Float64(sqrt(l) * sqrt(Float64(V / A))));
	elseif (Float64(l * V) <= -2e-173)
		tmp = Float64(c0 * (Float64(A / Float64(l * V)) ^ 0.5));
	elseif (Float64(l * V) <= 2e-270)
		tmp = Float64(c0 * (Float64(V * Float64(l / A)) ^ -0.5));
	else
		tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(l * V))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, A, V, l)
	tmp = 0.0;
	if ((l * V) <= -2e+272)
		tmp = c0 / (sqrt(l) * sqrt((V / A)));
	elseif ((l * V) <= -2e-173)
		tmp = c0 * ((A / (l * V)) ^ 0.5);
	elseif ((l * V) <= 2e-270)
		tmp = c0 * ((V * (l / A)) ^ -0.5);
	else
		tmp = c0 * (sqrt(A) / sqrt((l * V)));
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, A_, V_, l_] := If[LessEqual[N[(l * V), $MachinePrecision], -2e+272], N[(c0 / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[N[(V / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -2e-173], N[(c0 * N[Power[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 2e-270], N[(c0 * N[Power[N[(V * N[(l / A), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 14: 79.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\ell \cdot V \leq -5 \cdot 10^{+164}:\\ \;\;\;\;\frac{c0}{\frac{\sqrt{\ell}}{\sqrt{\frac{A}{V}}}}\\ \mathbf{elif}\;\ell \cdot V \leq -2 \cdot 10^{-173}:\\ \;\;\;\;c0 \cdot {\left(\frac{A}{\ell \cdot V}\right)}^{0.5}\\ \mathbf{elif}\;\ell \cdot V \leq 2 \cdot 10^{-270}:\\ \;\;\;\;c0 \cdot {\left(V \cdot \frac{\ell}{A}\right)}^{-0.5}\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{\ell \cdot V}}\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 A V l)
 :precision binary64
 (if (<= (* l V) -5e+164)
   (/ c0 (/ (sqrt l) (sqrt (/ A V))))
   (if (<= (* l V) -2e-173)
     (* c0 (pow (/ A (* l V)) 0.5))
     (if (<= (* l V) 2e-270)
       (* c0 (pow (* V (/ l A)) -0.5))
       (* c0 (/ (sqrt A) (sqrt (* l V))))))))

C

double code(double c0, double A, double V, double l) {
	double tmp;
	if ((l * V) <= -5e+164) {
		tmp = c0 / (sqrt(l) / sqrt((A / V)));
	} else if ((l * V) <= -2e-173) {
		tmp = c0 * pow((A / (l * V)), 0.5);
	} else if ((l * V) <= 2e-270) {
		tmp = c0 * pow((V * (l / A)), -0.5);
	} else {
		tmp = c0 * (sqrt(A) / sqrt((l * V)));
	}
	return tmp;
}

Fortran

real(8) function code(c0, a, v, l)
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    real(8) :: tmp
    if ((l * v) <= (-5d+164)) then
        tmp = c0 / (sqrt(l) / sqrt((a / v)))
    else if ((l * v) <= (-2d-173)) then
        tmp = c0 * ((a / (l * v)) ** 0.5d0)
    else if ((l * v) <= 2d-270) then
        tmp = c0 * ((v * (l / a)) ** (-0.5d0))
    else
        tmp = c0 * (sqrt(a) / sqrt((l * v)))
    end if
    code = tmp
end function

Java

public static double code(double c0, double A, double V, double l) {
	double tmp;
	if ((l * V) <= -5e+164) {
		tmp = c0 / (Math.sqrt(l) / Math.sqrt((A / V)));
	} else if ((l * V) <= -2e-173) {
		tmp = c0 * Math.pow((A / (l * V)), 0.5);
	} else if ((l * V) <= 2e-270) {
		tmp = c0 * Math.pow((V * (l / A)), -0.5);
	} else {
		tmp = c0 * (Math.sqrt(A) / Math.sqrt((l * V)));
	}
	return tmp;
}

Python

def code(c0, A, V, l):
	tmp = 0
	if (l * V) <= -5e+164:
		tmp = c0 / (math.sqrt(l) / math.sqrt((A / V)))
	elif (l * V) <= -2e-173:
		tmp = c0 * math.pow((A / (l * V)), 0.5)
	elif (l * V) <= 2e-270:
		tmp = c0 * math.pow((V * (l / A)), -0.5)
	else:
		tmp = c0 * (math.sqrt(A) / math.sqrt((l * V)))
	return tmp

Julia

function code(c0, A, V, l)
	tmp = 0.0
	if (Float64(l * V) <= -5e+164)
		tmp = Float64(c0 / Float64(sqrt(l) / sqrt(Float64(A / V))));
	elseif (Float64(l * V) <= -2e-173)
		tmp = Float64(c0 * (Float64(A / Float64(l * V)) ^ 0.5));
	elseif (Float64(l * V) <= 2e-270)
		tmp = Float64(c0 * (Float64(V * Float64(l / A)) ^ -0.5));
	else
		tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(l * V))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, A, V, l)
	tmp = 0.0;
	if ((l * V) <= -5e+164)
		tmp = c0 / (sqrt(l) / sqrt((A / V)));
	elseif ((l * V) <= -2e-173)
		tmp = c0 * ((A / (l * V)) ^ 0.5);
	elseif ((l * V) <= 2e-270)
		tmp = c0 * ((V * (l / A)) ^ -0.5);
	else
		tmp = c0 * (sqrt(A) / sqrt((l * V)));
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, A_, V_, l_] := If[LessEqual[N[(l * V), $MachinePrecision], -5e+164], N[(c0 / N[(N[Sqrt[l], $MachinePrecision] / N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -2e-173], N[(c0 * N[Power[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 2e-270], N[(c0 * N[Power[N[(V * N[(l / A), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 15: 73.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ c0 \cdot \sqrt{\frac{A}{\ell \cdot V}} \end{array} \]

FPCore

(FPCore (c0 A V l) :precision binary64 (* c0 (sqrt (/ A (* l V)))))

C

double code(double c0, double A, double V, double l) {
	return c0 * sqrt((A / (l * V)));
}

Fortran

real(8) function code(c0, a, v, l)
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    code = c0 * sqrt((a / (l * v)))
end function

Java

public static double code(double c0, double A, double V, double l) {
	return c0 * Math.sqrt((A / (l * V)));
}

Python

def code(c0, A, V, l):
	return c0 * math.sqrt((A / (l * V)))

Julia

function code(c0, A, V, l)
	return Float64(c0 * sqrt(Float64(A / Float64(l * V))))
end

MATLAB

function tmp = code(c0, A, V, l)
	tmp = c0 * sqrt((A / (l * V)));
end

Wolfram

code[c0_, A_, V_, l_] := N[(c0 * N[Sqrt[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Reproduce

herbie shell --seed 2023342 
(FPCore (c0 A V l)
  :name "Henrywood and Agarwal, Equation (3)"
  :precision binary64
  (* c0 (sqrt (/ A (* V l)))))