Dejan.brkic (talk | contribs) (Created page with " == Abstract == he 80 year-old empirical Colebrook function ξ, widely used as an informal standard for hydraulic resistance, relates implicitly the unknown flow friction fac...") |
Dejan.brkic (talk | contribs) |
||
Line 2: | Line 2: | ||
== Abstract == | == Abstract == | ||
− | + | The 80 year-old empirical Colebrook function ξ, widely used as an informal standard for hydraulic resistance, relates implicitly the unknown flow friction factor λ, with the known Reynolds number R e and the known relative roughness of a pipe inner surface ε*; λ= ξ (R e, ε*, λ). It is based on logarithmic law in the form that captures the unknown flow friction factor λ in a way that it cannot be extracted analytically. As an alternative to the explicit approximations or to the iterative procedures that require at least a few evaluations of computationally expensive logarithmic function or non-integer powers, this paper offers an accurate and computationally cheap iterative algorithm based on Padé polynomials with only one l o g-call in total for the whole procedure (expensive l o g-calls are substituted with Padé polynomials in each iteration with the exception of the first). The proposed modification is computationally less demanding compared with the standard approaches of engineering practice, but does not influence the accuracy or the number of iterations required to reach the final balanced solution. | |
== Full document == | == Full document == | ||
<pdf>Media:Draft_Brkic_955317190-6994-document.pdf</pdf> | <pdf>Media:Draft_Brkic_955317190-6994-document.pdf</pdf> |
The 80 year-old empirical Colebrook function ξ, widely used as an informal standard for hydraulic resistance, relates implicitly the unknown flow friction factor λ, with the known Reynolds number R e and the known relative roughness of a pipe inner surface ε*; λ= ξ (R e, ε*, λ). It is based on logarithmic law in the form that captures the unknown flow friction factor λ in a way that it cannot be extracted analytically. As an alternative to the explicit approximations or to the iterative procedures that require at least a few evaluations of computationally expensive logarithmic function or non-integer powers, this paper offers an accurate and computationally cheap iterative algorithm based on Padé polynomials with only one l o g-call in total for the whole procedure (expensive l o g-calls are substituted with Padé polynomials in each iteration with the exception of the first). The proposed modification is computationally less demanding compared with the standard approaches of engineering practice, but does not influence the accuracy or the number of iterations required to reach the final balanced solution.
Published on 01/01/2018
DOI: 10.3390/en11071825
Licence: CC BY-NC-SA license
Are you one of the authors of this document?